./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.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 975c15972d2e28638994433ae48be96fd627b5ee7b57bfcfea19e46a5c8b87bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:11:49,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:11:49,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:11:49,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:11:49,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:11:49,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:11:49,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:11:49,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:11:49,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:11:49,834 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:11:49,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:11:49,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:11:49,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:11:49,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:11:49,835 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:11:49,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:11:49,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:11:49,837 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:11:49,837 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:11:49,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:11:49,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:11:49,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:11:49,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:49,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:11:49,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:11:49,838 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 -> 975c15972d2e28638994433ae48be96fd627b5ee7b57bfcfea19e46a5c8b87bf [2025-03-03 20:11:50,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:11:50,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:11:50,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:11:50,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:11:50,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:11:50,073 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-83.i [2025-03-03 20:11:51,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f77280c/92149e72df64479dbd36bc68b995127a/FLAGe4ec22060 [2025-03-03 20:11:51,538 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:11:51,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i [2025-03-03 20:11:51,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f77280c/92149e72df64479dbd36bc68b995127a/FLAGe4ec22060 [2025-03-03 20:11:51,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f77280c/92149e72df64479dbd36bc68b995127a [2025-03-03 20:11:51,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:11:51,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:11:51,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:51,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:11:51,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:11:51,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:51" (1/1) ... [2025-03-03 20:11:51,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e27fb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:51, skipping insertion in model container [2025-03-03 20:11:51,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:51" (1/1) ... [2025-03-03 20:11:51,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:11:51,952 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-83.i[916,929] [2025-03-03 20:11:52,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:52,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:11:52,145 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-83.i[916,929] [2025-03-03 20:11:52,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:52,238 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:11:52,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52 WrapperNode [2025-03-03 20:11:52,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:52,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:52,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:11:52,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:11:52,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,326 INFO L138 Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 946 [2025-03-03 20:11:52,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:52,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:11:52,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:11:52,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:11:52,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,393 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:11:52,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:11:52,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:11:52,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:11:52,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:11:52,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (1/1) ... [2025-03-03 20:11:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:52,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:52,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:11:52,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:11:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:11:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:11:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:11:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:11:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:11:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:11:52,653 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:11:52,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:11:53,553 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: havoc property_#t~ite90#1;havoc property_#t~bitwise88#1;havoc property_#t~bitwise89#1;havoc property_#t~short91#1; [2025-03-03 20:11:53,699 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 20:11:53,699 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:11:53,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:11:53,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:11:53,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:53 BoogieIcfgContainer [2025-03-03 20:11:53,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:11:53,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:11:53,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:11:53,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:11:53,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:11:51" (1/3) ... [2025-03-03 20:11:53,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625a2af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:53, skipping insertion in model container [2025-03-03 20:11:53,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:52" (2/3) ... [2025-03-03 20:11:53,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625a2af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:53, skipping insertion in model container [2025-03-03 20:11:53,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:53" (3/3) ... [2025-03-03 20:11:53,747 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-83.i [2025-03-03 20:11:53,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:11:53,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-83.i that has 2 procedures, 382 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:11:53,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:11:53,832 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;@5b6d7e1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:11:53,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:11:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 274 states have (on average 1.602189781021898) internal successors, (439), 275 states have internal predecessors, (439), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 20:11:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 20:11:53,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:53,864 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:53,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1608523680, now seen corresponding path program 1 times [2025-03-03 20:11:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776014894] [2025-03-03 20:11:53,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:54,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:54,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:54,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:54,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-03 20:11:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776014894] [2025-03-03 20:11:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776014894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355170881] [2025-03-03 20:11:54,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:54,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:54,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:54,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:54,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:11:54,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:54,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:54,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:54,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:54,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:11:54,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-03 20:11:54,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355170881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:11:54,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854689026] [2025-03-03 20:11:54,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:11:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:54,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:11:54,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:54,900 INFO L87 Difference]: Start difference. First operand has 382 states, 274 states have (on average 1.602189781021898) internal successors, (439), 275 states have internal predecessors, (439), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:11:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:54,998 INFO L93 Difference]: Finished difference Result 758 states and 1398 transitions. [2025-03-03 20:11:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:11:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 685 [2025-03-03 20:11:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:55,011 INFO L225 Difference]: With dead ends: 758 [2025-03-03 20:11:55,011 INFO L226 Difference]: Without dead ends: 379 [2025-03-03 20:11:55,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:55,021 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:55,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-03 20:11:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-03 20:11:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 272 states have (on average 1.5955882352941178) internal successors, (434), 272 states have internal predecessors, (434), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 20:11:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 644 transitions. [2025-03-03 20:11:55,102 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 644 transitions. Word has length 685 [2025-03-03 20:11:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 644 transitions. [2025-03-03 20:11:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:11:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 644 transitions. [2025-03-03 20:11:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 20:11:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:55,118 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:55,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:11:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:11:55,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -619211701, now seen corresponding path program 1 times [2025-03-03 20:11:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294724494] [2025-03-03 20:11:55,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:55,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:55,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:55,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:55,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:11:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294724494] [2025-03-03 20:11:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294724494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:56,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:56,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616987649] [2025-03-03 20:11:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:56,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:56,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:56,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:56,009 INFO L87 Difference]: Start difference. First operand 379 states and 644 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:11:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:56,140 INFO L93 Difference]: Finished difference Result 1001 states and 1708 transitions. [2025-03-03 20:11:56,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:56,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-03-03 20:11:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:56,151 INFO L225 Difference]: With dead ends: 1001 [2025-03-03 20:11:56,151 INFO L226 Difference]: Without dead ends: 625 [2025-03-03 20:11:56,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:56,155 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 403 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:56,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1224 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-03 20:11:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 622. [2025-03-03 20:11:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 470 states have (on average 1.6297872340425532) internal successors, (766), 471 states have internal predecessors, (766), 149 states have call successors, (149), 2 states have call predecessors, (149), 2 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-03 20:11:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1064 transitions. [2025-03-03 20:11:56,239 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1064 transitions. Word has length 685 [2025-03-03 20:11:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 1064 transitions. [2025-03-03 20:11:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:11:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1064 transitions. [2025-03-03 20:11:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 20:11:56,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:56,250 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:11:56,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash 685182028, now seen corresponding path program 1 times [2025-03-03 20:11:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:56,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375840732] [2025-03-03 20:11:56,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:56,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:11:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375840732] [2025-03-03 20:11:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375840732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859559764] [2025-03-03 20:11:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:56,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:56,680 INFO L87 Difference]: Start difference. First operand 622 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:11:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:56,826 INFO L93 Difference]: Finished difference Result 1633 states and 2792 transitions. [2025-03-03 20:11:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:56,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-03-03 20:11:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:56,839 INFO L225 Difference]: With dead ends: 1633 [2025-03-03 20:11:56,839 INFO L226 Difference]: Without dead ends: 1014 [2025-03-03 20:11:56,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:56,845 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 292 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:56,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1332 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-03 20:11:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1011. [2025-03-03 20:11:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 767 states have (on average 1.6179921773142112) internal successors, (1241), 770 states have internal predecessors, (1241), 239 states have call successors, (239), 4 states have call predecessors, (239), 4 states have return successors, (239), 236 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-03 20:11:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1719 transitions. [2025-03-03 20:11:56,929 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1719 transitions. Word has length 685 [2025-03-03 20:11:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:56,930 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1719 transitions. [2025-03-03 20:11:56,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:11:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1719 transitions. [2025-03-03 20:11:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 20:11:56,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:56,935 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:11:56,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:56,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1571728979, now seen corresponding path program 1 times [2025-03-03 20:11:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422423338] [2025-03-03 20:11:56,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:56,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:57,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:57,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:57,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:11:57,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:57,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422423338] [2025-03-03 20:11:57,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422423338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:57,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:57,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:57,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407792263] [2025-03-03 20:11:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:57,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:57,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:57,374 INFO L87 Difference]: Start difference. First operand 1011 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:11:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:57,466 INFO L93 Difference]: Finished difference Result 2019 states and 3435 transitions. [2025-03-03 20:11:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-03-03 20:11:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:57,474 INFO L225 Difference]: With dead ends: 2019 [2025-03-03 20:11:57,476 INFO L226 Difference]: Without dead ends: 1011 [2025-03-03 20:11:57,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:57,499 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 0 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:57,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1221 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-03 20:11:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2025-03-03 20:11:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 767 states have (on average 1.6127770534550196) internal successors, (1237), 770 states have internal predecessors, (1237), 239 states have call successors, (239), 4 states have call predecessors, (239), 4 states have return successors, (239), 236 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-03 20:11:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1715 transitions. [2025-03-03 20:11:57,570 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1715 transitions. Word has length 685 [2025-03-03 20:11:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1715 transitions. [2025-03-03 20:11:57,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:11:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1715 transitions. [2025-03-03 20:11:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 20:11:57,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:57,581 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:11:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:11:57,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash 61075020, now seen corresponding path program 1 times [2025-03-03 20:11:57,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:57,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294922677] [2025-03-03 20:11:57,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:57,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:58,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:58,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:58,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 84 proven. 228 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:11:58,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:58,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294922677] [2025-03-03 20:11:58,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294922677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309923189] [2025-03-03 20:11:58,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:58,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:58,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:58,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:11:58,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:11:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:11:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:59,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:11:59,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 10914 proven. 171 refuted. 0 times theorem prover too weak. 10755 trivial. 0 not checked. [2025-03-03 20:11:59,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:12:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 141 proven. 171 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:12:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309923189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:12:00,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:12:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 20:12:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367148674] [2025-03-03 20:12:00,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:12:00,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:00,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:00,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:00,303 INFO L87 Difference]: Start difference. First operand 1011 states and 1715 transitions. Second operand has 8 states, 8 states have (on average 31.5) internal successors, (252), 8 states have internal predecessors, (252), 3 states have call successors, (238), 2 states have call predecessors, (238), 4 states have return successors, (240), 3 states have call predecessors, (240), 3 states have call successors, (240) [2025-03-03 20:12:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:01,148 INFO L93 Difference]: Finished difference Result 1648 states and 2789 transitions. [2025-03-03 20:12:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:12:01,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.5) internal successors, (252), 8 states have internal predecessors, (252), 3 states have call successors, (238), 2 states have call predecessors, (238), 4 states have return successors, (240), 3 states have call predecessors, (240), 3 states have call successors, (240) Word has length 685 [2025-03-03 20:12:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:01,156 INFO L225 Difference]: With dead ends: 1648 [2025-03-03 20:12:01,156 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 20:12:01,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1367 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:12:01,162 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1446 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:01,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 1172 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:12:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 20:12:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 634. [2025-03-03 20:12:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 479 states have (on average 1.5845511482254697) internal successors, (759), 480 states have internal predecessors, (759), 149 states have call successors, (149), 5 states have call predecessors, (149), 5 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-03 20:12:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1057 transitions. [2025-03-03 20:12:01,200 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1057 transitions. Word has length 685 [2025-03-03 20:12:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:01,200 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 1057 transitions. [2025-03-03 20:12:01,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.5) internal successors, (252), 8 states have internal predecessors, (252), 3 states have call successors, (238), 2 states have call predecessors, (238), 4 states have return successors, (240), 3 states have call predecessors, (240), 3 states have call successors, (240) [2025-03-03 20:12:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1057 transitions. [2025-03-03 20:12:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-03-03 20:12:01,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:01,205 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:01,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:12:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:01,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -635195531, now seen corresponding path program 1 times [2025-03-03 20:12:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40345875] [2025-03-03 20:12:01,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:01,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-03-03 20:12:01,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-03-03 20:12:01,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:01,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40345875] [2025-03-03 20:12:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40345875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:12:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89512890] [2025-03-03 20:12:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:01,991 INFO L87 Difference]: Start difference. First operand 634 states and 1057 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:04,195 INFO L93 Difference]: Finished difference Result 5099 states and 8585 transitions. [2025-03-03 20:12:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:12:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 686 [2025-03-03 20:12:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:04,216 INFO L225 Difference]: With dead ends: 5099 [2025-03-03 20:12:04,216 INFO L226 Difference]: Without dead ends: 4468 [2025-03-03 20:12:04,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:12:04,220 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 4197 mSDsluCounter, 3768 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:04,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 4592 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 20:12:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2025-03-03 20:12:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 1301. [2025-03-03 20:12:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1039 states have (on average 1.6198267564966313) internal successors, (1683), 1042 states have internal predecessors, (1683), 247 states have call successors, (247), 14 states have call predecessors, (247), 14 states have return successors, (247), 244 states have call predecessors, (247), 247 states have call successors, (247) [2025-03-03 20:12:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2177 transitions. [2025-03-03 20:12:04,326 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2177 transitions. Word has length 686 [2025-03-03 20:12:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:04,327 INFO L471 AbstractCegarLoop]: Abstraction has 1301 states and 2177 transitions. [2025-03-03 20:12:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2177 transitions. [2025-03-03 20:12:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 20:12:04,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:04,332 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:12:04,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:04,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash 163736818, now seen corresponding path program 1 times [2025-03-03 20:12:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:04,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765534268] [2025-03-03 20:12:04,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 20:12:04,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 20:12:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:04,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765534268] [2025-03-03 20:12:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765534268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:12:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357370492] [2025-03-03 20:12:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:04,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:04,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:04,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:04,910 INFO L87 Difference]: Start difference. First operand 1301 states and 2177 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:06,976 INFO L93 Difference]: Finished difference Result 5834 states and 9762 transitions. [2025-03-03 20:12:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:12:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 687 [2025-03-03 20:12:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:07,004 INFO L225 Difference]: With dead ends: 5834 [2025-03-03 20:12:07,005 INFO L226 Difference]: Without dead ends: 4536 [2025-03-03 20:12:07,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:12:07,048 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 4159 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4159 SdHoareTripleChecker+Valid, 3809 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:07,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4159 Valid, 3809 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [612 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 20:12:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2025-03-03 20:12:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 2677. [2025-03-03 20:12:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2154 states have (on average 1.6128133704735377) internal successors, (3474), 2160 states have internal predecessors, (3474), 494 states have call successors, (494), 28 states have call predecessors, (494), 28 states have return successors, (494), 488 states have call predecessors, (494), 494 states have call successors, (494) [2025-03-03 20:12:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4462 transitions. [2025-03-03 20:12:07,227 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4462 transitions. Word has length 687 [2025-03-03 20:12:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:07,228 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 4462 transitions. [2025-03-03 20:12:07,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4462 transitions. [2025-03-03 20:12:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 20:12:07,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:07,235 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:07,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:12:07,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:07,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash -561984748, now seen corresponding path program 1 times [2025-03-03 20:12:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055545017] [2025-03-03 20:12:07,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:07,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:07,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 20:12:07,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 20:12:07,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:07,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 84 proven. 228 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:12:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055545017] [2025-03-03 20:12:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055545017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620967485] [2025-03-03 20:12:08,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:08,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:08,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:12:08,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:12:08,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 20:12:08,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 20:12:08,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:08,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:08,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 20:12:08,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 15236 proven. 198 refuted. 0 times theorem prover too weak. 6406 trivial. 0 not checked. [2025-03-03 20:12:09,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:12:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 114 proven. 198 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:12:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620967485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:12:10,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:12:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 24 [2025-03-03 20:12:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284434179] [2025-03-03 20:12:10,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:12:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 20:12:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:10,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 20:12:10,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-03 20:12:10,472 INFO L87 Difference]: Start difference. First operand 2677 states and 4462 transitions. Second operand has 24 states, 24 states have (on average 13.416666666666666) internal successors, (322), 24 states have internal predecessors, (322), 9 states have call successors, (247), 4 states have call predecessors, (247), 6 states have return successors, (249), 9 states have call predecessors, (249), 9 states have call successors, (249) [2025-03-03 20:12:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:14,672 INFO L93 Difference]: Finished difference Result 11597 states and 19034 transitions. [2025-03-03 20:12:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-03 20:12:14,673 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.416666666666666) internal successors, (322), 24 states have internal predecessors, (322), 9 states have call successors, (247), 4 states have call predecessors, (247), 6 states have return successors, (249), 9 states have call predecessors, (249), 9 states have call successors, (249) Word has length 687 [2025-03-03 20:12:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:14,709 INFO L225 Difference]: With dead ends: 11597 [2025-03-03 20:12:14,710 INFO L226 Difference]: Without dead ends: 8923 [2025-03-03 20:12:14,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1367 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1707, Invalid=6125, Unknown=0, NotChecked=0, Total=7832 [2025-03-03 20:12:14,720 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 7493 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 2524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7493 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 6186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2524 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:14,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7493 Valid, 4963 Invalid, 6186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2524 Valid, 3662 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 20:12:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2025-03-03 20:12:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 1681. [2025-03-03 20:12:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1354 states have (on average 1.5901033973412113) internal successors, (2153), 1356 states have internal predecessors, (2153), 298 states have call successors, (298), 28 states have call predecessors, (298), 28 states have return successors, (298), 296 states have call predecessors, (298), 298 states have call successors, (298) [2025-03-03 20:12:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2749 transitions. [2025-03-03 20:12:14,904 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2749 transitions. Word has length 687 [2025-03-03 20:12:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:14,904 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2749 transitions. [2025-03-03 20:12:14,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.416666666666666) internal successors, (322), 24 states have internal predecessors, (322), 9 states have call successors, (247), 4 states have call predecessors, (247), 6 states have return successors, (249), 9 states have call predecessors, (249), 9 states have call successors, (249) [2025-03-03 20:12:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2749 transitions. [2025-03-03 20:12:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 20:12:14,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:14,910 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:14,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:12:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:15,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:15,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:15,112 INFO L85 PathProgramCache]: Analyzing trace with hash -68303107, now seen corresponding path program 1 times [2025-03-03 20:12:15,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:15,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192689093] [2025-03-03 20:12:15,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 20:12:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 20:12:15,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:15,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192689093] [2025-03-03 20:12:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192689093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804466363] [2025-03-03 20:12:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:16,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:16,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:16,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:16,345 INFO L87 Difference]: Start difference. First operand 1681 states and 2749 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:17,051 INFO L93 Difference]: Finished difference Result 5359 states and 8649 transitions. [2025-03-03 20:12:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:17,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 687 [2025-03-03 20:12:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:17,068 INFO L225 Difference]: With dead ends: 5359 [2025-03-03 20:12:17,068 INFO L226 Difference]: Without dead ends: 3681 [2025-03-03 20:12:17,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:17,073 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 814 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:17,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1957 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2025-03-03 20:12:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2809. [2025-03-03 20:12:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2226 states have (on average 1.569182389937107) internal successors, (3493), 2232 states have internal predecessors, (3493), 528 states have call successors, (528), 54 states have call predecessors, (528), 54 states have return successors, (528), 522 states have call predecessors, (528), 528 states have call successors, (528) [2025-03-03 20:12:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 4549 transitions. [2025-03-03 20:12:17,311 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 4549 transitions. Word has length 687 [2025-03-03 20:12:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:17,312 INFO L471 AbstractCegarLoop]: Abstraction has 2809 states and 4549 transitions. [2025-03-03 20:12:17,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 4549 transitions. [2025-03-03 20:12:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 20:12:17,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:17,318 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:17,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:12:17,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:17,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 369706396, now seen corresponding path program 1 times [2025-03-03 20:12:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575804890] [2025-03-03 20:12:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:17,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 20:12:17,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 20:12:17,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:17,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575804890] [2025-03-03 20:12:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575804890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:17,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435779309] [2025-03-03 20:12:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:17,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:17,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:17,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:17,799 INFO L87 Difference]: Start difference. First operand 2809 states and 4549 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:18,728 INFO L93 Difference]: Finished difference Result 8757 states and 14241 transitions. [2025-03-03 20:12:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 687 [2025-03-03 20:12:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:18,752 INFO L225 Difference]: With dead ends: 8757 [2025-03-03 20:12:18,752 INFO L226 Difference]: Without dead ends: 5951 [2025-03-03 20:12:18,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:18,761 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 768 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:18,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1862 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2025-03-03 20:12:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 5613. [2025-03-03 20:12:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5613 states, 4448 states have (on average 1.5660971223021583) internal successors, (6966), 4460 states have internal predecessors, (6966), 1056 states have call successors, (1056), 108 states have call predecessors, (1056), 108 states have return successors, (1056), 1044 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-03-03 20:12:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 9078 transitions. [2025-03-03 20:12:19,250 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 9078 transitions. Word has length 687 [2025-03-03 20:12:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:19,251 INFO L471 AbstractCegarLoop]: Abstraction has 5613 states and 9078 transitions. [2025-03-03 20:12:19,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 9078 transitions. [2025-03-03 20:12:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:12:19,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:19,259 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:19,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:12:19,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1238884791, now seen corresponding path program 1 times [2025-03-03 20:12:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822784910] [2025-03-03 20:12:19,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:19,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:12:19,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:12:19,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:19,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822784910] [2025-03-03 20:12:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822784910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:20,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:20,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:12:20,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912738493] [2025-03-03 20:12:20,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:12:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:20,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:12:20,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:20,178 INFO L87 Difference]: Start difference. First operand 5613 states and 9078 transitions. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 3 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 3 states have call predecessors, (105), 3 states have call successors, (105) [2025-03-03 20:12:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:23,336 INFO L93 Difference]: Finished difference Result 18713 states and 29936 transitions. [2025-03-03 20:12:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:12:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 3 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 3 states have call predecessors, (105), 3 states have call successors, (105) Word has length 688 [2025-03-03 20:12:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:23,384 INFO L225 Difference]: With dead ends: 18713 [2025-03-03 20:12:23,385 INFO L226 Difference]: Without dead ends: 13103 [2025-03-03 20:12:23,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:12:23,400 INFO L435 NwaCegarLoop]: 1063 mSDtfsCounter, 1916 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:23,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 2858 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 20:12:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13103 states. [2025-03-03 20:12:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13103 to 7356. [2025-03-03 20:12:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7356 states, 5754 states have (on average 1.550921098366354) internal successors, (8924), 5775 states have internal predecessors, (8924), 1446 states have call successors, (1446), 155 states have call predecessors, (1446), 155 states have return successors, (1446), 1425 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-03 20:12:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 11816 transitions. [2025-03-03 20:12:24,227 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 11816 transitions. Word has length 688 [2025-03-03 20:12:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:24,228 INFO L471 AbstractCegarLoop]: Abstraction has 7356 states and 11816 transitions. [2025-03-03 20:12:24,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 3 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 3 states have call predecessors, (105), 3 states have call successors, (105) [2025-03-03 20:12:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 11816 transitions. [2025-03-03 20:12:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:12:24,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:24,237 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:24,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:12:24,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:24,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 949023832, now seen corresponding path program 1 times [2025-03-03 20:12:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991062262] [2025-03-03 20:12:24,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:24,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:12:24,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:12:24,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:24,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991062262] [2025-03-03 20:12:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991062262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:24,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949979051] [2025-03-03 20:12:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:24,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:24,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:24,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:24,522 INFO L87 Difference]: Start difference. First operand 7356 states and 11816 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:26,238 INFO L93 Difference]: Finished difference Result 21840 states and 35126 transitions. [2025-03-03 20:12:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 688 [2025-03-03 20:12:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:26,284 INFO L225 Difference]: With dead ends: 21840 [2025-03-03 20:12:26,284 INFO L226 Difference]: Without dead ends: 14598 [2025-03-03 20:12:26,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:26,303 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 406 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:26,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1202 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2025-03-03 20:12:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2025-03-03 20:12:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14596 states, 11454 states have (on average 1.5521215295966475) internal successors, (17778), 11495 states have internal predecessors, (17778), 2838 states have call successors, (2838), 303 states have call predecessors, (2838), 303 states have return successors, (2838), 2797 states have call predecessors, (2838), 2838 states have call successors, (2838) [2025-03-03 20:12:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 23454 transitions. [2025-03-03 20:12:27,908 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 23454 transitions. Word has length 688 [2025-03-03 20:12:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:27,909 INFO L471 AbstractCegarLoop]: Abstraction has 14596 states and 23454 transitions. [2025-03-03 20:12:27,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:12:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 23454 transitions. [2025-03-03 20:12:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:12:27,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:27,922 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:27,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:12:27,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:27,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -751716647, now seen corresponding path program 1 times [2025-03-03 20:12:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724911809] [2025-03-03 20:12:27,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:27,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:12:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:12:28,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:28,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:12:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724911809] [2025-03-03 20:12:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724911809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:28,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:28,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:12:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450343660] [2025-03-03 20:12:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:28,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:12:28,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:28,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:12:28,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:12:28,800 INFO L87 Difference]: Start difference. First operand 14596 states and 23454 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 2 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:12:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:33,627 INFO L93 Difference]: Finished difference Result 36639 states and 58461 transitions. [2025-03-03 20:12:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:12:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 2 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105) Word has length 688 [2025-03-03 20:12:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:33,710 INFO L225 Difference]: With dead ends: 36639 [2025-03-03 20:12:33,711 INFO L226 Difference]: Without dead ends: 22157 [2025-03-03 20:12:33,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:12:33,748 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 2147 mSDsluCounter, 3745 mSDsCounter, 0 mSdLazyCounter, 3401 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 5401 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 3401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:33,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 5401 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 3401 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 20:12:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22157 states. [2025-03-03 20:12:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22157 to 15596. [2025-03-03 20:12:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15596 states, 12318 states have (on average 1.5588569572982627) internal successors, (19202), 12359 states have internal predecessors, (19202), 2950 states have call successors, (2950), 327 states have call predecessors, (2950), 327 states have return successors, (2950), 2909 states have call predecessors, (2950), 2950 states have call successors, (2950) [2025-03-03 20:12:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15596 states to 15596 states and 25102 transitions. [2025-03-03 20:12:35,428 INFO L78 Accepts]: Start accepts. Automaton has 15596 states and 25102 transitions. Word has length 688 [2025-03-03 20:12:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:35,429 INFO L471 AbstractCegarLoop]: Abstraction has 15596 states and 25102 transitions. [2025-03-03 20:12:35,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 2 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:12:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 15596 states and 25102 transitions. [2025-03-03 20:12:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:12:35,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:35,440 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:12:35,441 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1346644634, now seen corresponding path program 1 times [2025-03-03 20:12:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:35,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686371049] [2025-03-03 20:12:35,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:12:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:12:35,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:35,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 108 proven. 204 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:12:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686371049] [2025-03-03 20:12:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686371049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680125620] [2025-03-03 20:12:35,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:35,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:35,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:35,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:12:35,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:12:36,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:12:36,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:12:36,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:36,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:36,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:12:36,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 4704 proven. 36 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-03 20:12:36,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:12:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 276 proven. 36 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:12:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680125620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:12:36,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:12:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 20:12:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706896453] [2025-03-03 20:12:36,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:12:36,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:12:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:36,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:12:36,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:12:36,737 INFO L87 Difference]: Start difference. First operand 15596 states and 25102 transitions. Second operand has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 4 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 4 states have call predecessors, (187), 4 states have call successors, (187) [2025-03-03 20:12:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:38,839 INFO L93 Difference]: Finished difference Result 31586 states and 50494 transitions. [2025-03-03 20:12:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:12:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 4 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 4 states have call predecessors, (187), 4 states have call successors, (187) Word has length 688 [2025-03-03 20:12:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:38,895 INFO L225 Difference]: With dead ends: 31586 [2025-03-03 20:12:38,895 INFO L226 Difference]: Without dead ends: 16104 [2025-03-03 20:12:38,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1388 GetRequests, 1373 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:12:38,924 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1410 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:38,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 1216 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:12:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2025-03-03 20:12:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 15824. [2025-03-03 20:12:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15824 states, 12489 states have (on average 1.5377532228360957) internal successors, (19205), 12530 states have internal predecessors, (19205), 2950 states have call successors, (2950), 384 states have call predecessors, (2950), 384 states have return successors, (2950), 2909 states have call predecessors, (2950), 2950 states have call successors, (2950) [2025-03-03 20:12:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15824 states to 15824 states and 25105 transitions. [2025-03-03 20:12:40,658 INFO L78 Accepts]: Start accepts. Automaton has 15824 states and 25105 transitions. Word has length 688 [2025-03-03 20:12:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:40,658 INFO L471 AbstractCegarLoop]: Abstraction has 15824 states and 25105 transitions. [2025-03-03 20:12:40,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 4 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 4 states have call predecessors, (187), 4 states have call successors, (187) [2025-03-03 20:12:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 15824 states and 25105 transitions. [2025-03-03 20:12:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-03 20:12:40,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:40,668 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:40,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 20:12:40,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:40,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:40,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1065595095, now seen corresponding path program 1 times [2025-03-03 20:12:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12506820] [2025-03-03 20:12:40,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-03 20:12:41,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-03 20:12:41,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:41,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 84 proven. 228 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-03 20:12:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12506820] [2025-03-03 20:12:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12506820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491213195] [2025-03-03 20:12:41,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:41,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:41,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:12:41,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:12:41,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-03 20:12:41,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-03 20:12:41,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:41,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:41,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 20:12:41,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 14375 proven. 261 refuted. 0 times theorem prover too weak. 7204 trivial. 0 not checked. [2025-03-03 20:12:42,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:12:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 357 proven. 264 refuted. 0 times theorem prover too weak. 21219 trivial. 0 not checked. [2025-03-03 20:12:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491213195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:12:44,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:12:44,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-03-03 20:12:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007691382] [2025-03-03 20:12:44,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:12:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 20:12:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:44,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 20:12:44,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:12:44,162 INFO L87 Difference]: Start difference. First operand 15824 states and 25105 transitions. Second operand has 25 states, 25 states have (on average 14.28) internal successors, (357), 25 states have internal predecessors, (357), 6 states have call successors, (242), 3 states have call predecessors, (242), 7 states have return successors, (244), 6 states have call predecessors, (244), 6 states have call successors, (244) [2025-03-03 20:13:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:02,292 INFO L93 Difference]: Finished difference Result 132000 states and 212356 transitions. [2025-03-03 20:13:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-03 20:13:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 14.28) internal successors, (357), 25 states have internal predecessors, (357), 6 states have call successors, (242), 3 states have call predecessors, (242), 7 states have return successors, (244), 6 states have call predecessors, (244), 6 states have call successors, (244) Word has length 691 [2025-03-03 20:13:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:02,567 INFO L225 Difference]: With dead ends: 132000 [2025-03-03 20:13:02,568 INFO L226 Difference]: Without dead ends: 116294 [2025-03-03 20:13:02,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1504 GetRequests, 1384 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5001 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3567, Invalid=11195, Unknown=0, NotChecked=0, Total=14762 [2025-03-03 20:13:02,637 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 14237 mSDsluCounter, 5789 mSDsCounter, 0 mSdLazyCounter, 5520 mSolverCounterSat, 3546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14241 SdHoareTripleChecker+Valid, 6715 SdHoareTripleChecker+Invalid, 9066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3546 IncrementalHoareTripleChecker+Valid, 5520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:02,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14241 Valid, 6715 Invalid, 9066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3546 Valid, 5520 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 20:13:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116294 states. [2025-03-03 20:13:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116294 to 13432. [2025-03-03 20:13:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13432 states, 11164 states have (on average 1.5736295234682909) internal successors, (17568), 11189 states have internal predecessors, (17568), 1990 states have call successors, (1990), 277 states have call predecessors, (1990), 277 states have return successors, (1990), 1965 states have call predecessors, (1990), 1990 states have call successors, (1990) [2025-03-03 20:13:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13432 states to 13432 states and 21548 transitions. [2025-03-03 20:13:05,651 INFO L78 Accepts]: Start accepts. Automaton has 13432 states and 21548 transitions. Word has length 691 [2025-03-03 20:13:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:05,652 INFO L471 AbstractCegarLoop]: Abstraction has 13432 states and 21548 transitions. [2025-03-03 20:13:05,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.28) internal successors, (357), 25 states have internal predecessors, (357), 6 states have call successors, (242), 3 states have call predecessors, (242), 7 states have return successors, (244), 6 states have call predecessors, (244), 6 states have call successors, (244) [2025-03-03 20:13:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 13432 states and 21548 transitions. [2025-03-03 20:13:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:13:05,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:05,661 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:05,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 20:13:05,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 20:13:05,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:05,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 979781496, now seen corresponding path program 1 times [2025-03-03 20:13:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:05,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950423635] [2025-03-03 20:13:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:05,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:13:05,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:13:05,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:05,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:13:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950423635] [2025-03-03 20:13:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950423635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:06,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:06,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:13:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275833637] [2025-03-03 20:13:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:06,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:13:06,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:06,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:13:06,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:13:06,046 INFO L87 Difference]: Start difference. First operand 13432 states and 21548 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)