./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:16:26,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:16:26,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:16:26,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:16:26,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:16:26,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:16:26,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:16:26,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:16:26,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:16:26,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:16:26,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:16:26,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:16:26,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:16:26,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:16:26,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:16:26,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:16:26,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:16:26,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:16:26,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:16:26,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:16:26,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:16:26,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:16:26,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:16:26,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:16:26,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:16:26,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:26,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:16:26,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 [2025-03-08 11:16:26,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:16:26,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:16:26,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:16:26,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:16:26,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:16:26,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-08 11:16:27,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47c90ed9/1d9bc3fbc41e4b5093d998b218af622b/FLAGdbe40b83a [2025-03-08 11:16:28,188 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:16:28,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-08 11:16:28,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47c90ed9/1d9bc3fbc41e4b5093d998b218af622b/FLAGdbe40b83a [2025-03-08 11:16:28,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47c90ed9/1d9bc3fbc41e4b5093d998b218af622b [2025-03-08 11:16:28,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:16:28,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:16:28,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:28,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:16:28,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:16:28,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28, skipping insertion in model container [2025-03-08 11:16:28,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:16:28,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i[916,929] [2025-03-08 11:16:28,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:28,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:16:28,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i[916,929] [2025-03-08 11:16:28,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:28,671 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:16:28,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28 WrapperNode [2025-03-08 11:16:28,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:28,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:28,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:16:28,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:16:28,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,756 INFO L138 Inliner]: procedures = 26, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 820 [2025-03-08 11:16:28,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:28,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:16:28,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:16:28,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:16:28,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,799 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:16:28,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:16:28,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:16:28,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:16:28,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:16:28,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (1/1) ... [2025-03-08 11:16:28,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:28,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:28,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:16:28,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:16:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:16:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:16:28,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:16:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:16:28,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:16:28,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:16:29,040 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:16:29,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:16:30,015 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:16:30,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:16:30,053 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:16:30,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:16:30,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:30 BoogieIcfgContainer [2025-03-08 11:16:30,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:16:30,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:16:30,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:16:30,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:16:30,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:16:28" (1/3) ... [2025-03-08 11:16:30,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3f7917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:30, skipping insertion in model container [2025-03-08 11:16:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:28" (2/3) ... [2025-03-08 11:16:30,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3f7917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:30, skipping insertion in model container [2025-03-08 11:16:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:30" (3/3) ... [2025-03-08 11:16:30,064 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-08 11:16:30,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:16:30,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i that has 2 procedures, 339 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:16:30,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:16:30,150 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;@cad34f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:16:30,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:16:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 339 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 229 states have internal predecessors, (360), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 11:16:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-03-08 11:16:30,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:30,189 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:30,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:30,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1946880649, now seen corresponding path program 1 times [2025-03-08 11:16:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:30,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561212016] [2025-03-08 11:16:30,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:30,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-03-08 11:16:30,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-03-08 11:16:30,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561212016] [2025-03-08 11:16:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561212016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:30,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:16:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971948326] [2025-03-08 11:16:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:30,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:16:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:30,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:16:30,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:30,914 INFO L87 Difference]: Start difference. First operand has 339 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 229 states have internal predecessors, (360), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:30,992 INFO L93 Difference]: Finished difference Result 672 states and 1255 transitions. [2025-03-08 11:16:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:16:30,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 690 [2025-03-08 11:16:30,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:31,004 INFO L225 Difference]: With dead ends: 672 [2025-03-08 11:16:31,004 INFO L226 Difference]: Without dead ends: 336 [2025-03-08 11:16:31,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:31,013 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:31,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-08 11:16:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-03-08 11:16:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 226 states have (on average 1.5663716814159292) internal successors, (354), 226 states have internal predecessors, (354), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 11:16:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 570 transitions. [2025-03-08 11:16:31,101 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 570 transitions. Word has length 690 [2025-03-08 11:16:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:31,106 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 570 transitions. [2025-03-08 11:16:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 570 transitions. [2025-03-08 11:16:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-08 11:16:31,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:31,122 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 11:16:31,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1669884111, now seen corresponding path program 1 times [2025-03-08 11:16:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105409297] [2025-03-08 11:16:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:31,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-08 11:16:31,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-08 11:16:31,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:31,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105409297] [2025-03-08 11:16:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105409297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067818838] [2025-03-08 11:16:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:32,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:32,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:32,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:32,060 INFO L87 Difference]: Start difference. First operand 336 states and 570 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:32,172 INFO L93 Difference]: Finished difference Result 1001 states and 1702 transitions. [2025-03-08 11:16:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:32,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 691 [2025-03-08 11:16:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:32,182 INFO L225 Difference]: With dead ends: 1001 [2025-03-08 11:16:32,183 INFO L226 Difference]: Without dead ends: 668 [2025-03-08 11:16:32,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:32,185 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 349 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:32,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1090 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-08 11:16:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2025-03-08 11:16:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 447 states have (on average 1.5659955257270695) internal successors, (700), 447 states have internal predecessors, (700), 216 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-08 11:16:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1132 transitions. [2025-03-08 11:16:32,286 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1132 transitions. Word has length 691 [2025-03-08 11:16:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:32,287 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1132 transitions. [2025-03-08 11:16:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1132 transitions. [2025-03-08 11:16:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:32,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:32,310 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:32,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:16:32,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:32,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1775084902, now seen corresponding path program 1 times [2025-03-08 11:16:32,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:32,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592088405] [2025-03-08 11:16:32,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:32,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:32,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:32,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:32,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592088405] [2025-03-08 11:16:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592088405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430033319] [2025-03-08 11:16:32,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:32,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:32,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:32,637 INFO L87 Difference]: Start difference. First operand 666 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:32,749 INFO L93 Difference]: Finished difference Result 1714 states and 2928 transitions. [2025-03-08 11:16:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:32,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:32,759 INFO L225 Difference]: With dead ends: 1714 [2025-03-08 11:16:32,761 INFO L226 Difference]: Without dead ends: 1051 [2025-03-08 11:16:32,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:32,763 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 333 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:32,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1274 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-08 11:16:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1047. [2025-03-08 11:16:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 768 states have (on average 1.6197916666666667) internal successors, (1244), 770 states have internal predecessors, (1244), 274 states have call successors, (274), 4 states have call predecessors, (274), 4 states have return successors, (274), 272 states have call predecessors, (274), 274 states have call successors, (274) [2025-03-08 11:16:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1792 transitions. [2025-03-08 11:16:32,898 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1792 transitions. Word has length 692 [2025-03-08 11:16:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:32,900 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1792 transitions. [2025-03-08 11:16:32,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1792 transitions. [2025-03-08 11:16:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:32,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:32,908 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:16:32,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:32,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash 941929158, now seen corresponding path program 1 times [2025-03-08 11:16:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:32,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135723894] [2025-03-08 11:16:32,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:32,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:33,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:33,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:33,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135723894] [2025-03-08 11:16:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135723894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:33,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481301222] [2025-03-08 11:16:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:33,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:33,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:33,190 INFO L87 Difference]: Start difference. First operand 1047 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:33,308 INFO L93 Difference]: Finished difference Result 2857 states and 4904 transitions. [2025-03-08 11:16:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:33,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:33,320 INFO L225 Difference]: With dead ends: 2857 [2025-03-08 11:16:33,320 INFO L226 Difference]: Without dead ends: 1813 [2025-03-08 11:16:33,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:33,324 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 329 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:33,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1245 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-03-08 11:16:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1809. [2025-03-08 11:16:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1394 states have (on average 1.6384505021520803) internal successors, (2284), 1400 states have internal predecessors, (2284), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 11:16:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 3096 transitions. [2025-03-08 11:16:33,444 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 3096 transitions. Word has length 692 [2025-03-08 11:16:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 3096 transitions. [2025-03-08 11:16:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3096 transitions. [2025-03-08 11:16:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:33,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:33,454 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:33,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:16:33,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:33,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1202286938, now seen corresponding path program 1 times [2025-03-08 11:16:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120077615] [2025-03-08 11:16:33,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:33,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:33,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:33,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:33,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120077615] [2025-03-08 11:16:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120077615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:33,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:33,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746286402] [2025-03-08 11:16:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:33,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:33,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:33,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:33,705 INFO L87 Difference]: Start difference. First operand 1809 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:33,874 INFO L93 Difference]: Finished difference Result 5357 states and 9166 transitions. [2025-03-08 11:16:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:33,892 INFO L225 Difference]: With dead ends: 5357 [2025-03-08 11:16:33,893 INFO L226 Difference]: Without dead ends: 3551 [2025-03-08 11:16:33,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:33,898 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 544 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:33,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2025-03-08 11:16:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 1873. [2025-03-08 11:16:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1458 states have (on average 1.635116598079561) internal successors, (2384), 1464 states have internal predecessors, (2384), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 11:16:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3196 transitions. [2025-03-08 11:16:34,062 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3196 transitions. Word has length 692 [2025-03-08 11:16:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3196 transitions. [2025-03-08 11:16:34,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3196 transitions. [2025-03-08 11:16:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:34,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:34,069 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:34,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:16:34,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:34,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2095608005, now seen corresponding path program 1 times [2025-03-08 11:16:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249814259] [2025-03-08 11:16:34,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:34,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:34,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:34,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249814259] [2025-03-08 11:16:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249814259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134395578] [2025-03-08 11:16:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:34,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:34,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:34,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:34,554 INFO L87 Difference]: Start difference. First operand 1873 states and 3196 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:34,807 INFO L93 Difference]: Finished difference Result 4813 states and 8158 transitions. [2025-03-08 11:16:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:34,824 INFO L225 Difference]: With dead ends: 4813 [2025-03-08 11:16:34,824 INFO L226 Difference]: Without dead ends: 2943 [2025-03-08 11:16:34,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:34,831 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 190 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:34,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1108 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-03-08 11:16:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2937. [2025-03-08 11:16:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2258 states have (on average 1.6067316209034543) internal successors, (3628), 2272 states have internal predecessors, (3628), 662 states have call successors, (662), 16 states have call predecessors, (662), 16 states have return successors, (662), 648 states have call predecessors, (662), 662 states have call successors, (662) [2025-03-08 11:16:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4952 transitions. [2025-03-08 11:16:35,107 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4952 transitions. Word has length 692 [2025-03-08 11:16:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:35,108 INFO L471 AbstractCegarLoop]: Abstraction has 2937 states and 4952 transitions. [2025-03-08 11:16:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4952 transitions. [2025-03-08 11:16:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:35,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:35,116 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:16:35,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:35,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1317449114, now seen corresponding path program 1 times [2025-03-08 11:16:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658538842] [2025-03-08 11:16:35,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:35,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:35,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:35,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658538842] [2025-03-08 11:16:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658538842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457103741] [2025-03-08 11:16:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:35,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:35,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:35,863 INFO L87 Difference]: Start difference. First operand 2937 states and 4952 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:36,647 INFO L93 Difference]: Finished difference Result 11687 states and 19771 transitions. [2025-03-08 11:16:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:36,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:36,685 INFO L225 Difference]: With dead ends: 11687 [2025-03-08 11:16:36,686 INFO L226 Difference]: Without dead ends: 8753 [2025-03-08 11:16:36,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:36,694 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 894 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2443 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2025-03-08 11:16:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 7045. [2025-03-08 11:16:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 5116 states have (on average 1.5516028146989835) internal successors, (7938), 5162 states have internal predecessors, (7938), 1878 states have call successors, (1878), 50 states have call predecessors, (1878), 50 states have return successors, (1878), 1832 states have call predecessors, (1878), 1878 states have call successors, (1878) [2025-03-08 11:16:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 11694 transitions. [2025-03-08 11:16:37,288 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 11694 transitions. Word has length 692 [2025-03-08 11:16:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:37,289 INFO L471 AbstractCegarLoop]: Abstraction has 7045 states and 11694 transitions. [2025-03-08 11:16:37,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 11694 transitions. [2025-03-08 11:16:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:37,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:37,300 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:37,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:16:37,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:37,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash -351396568, now seen corresponding path program 1 times [2025-03-08 11:16:37,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:37,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379073606] [2025-03-08 11:16:37,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:37,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:37,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:37,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:37,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:38,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379073606] [2025-03-08 11:16:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379073606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:38,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440729738] [2025-03-08 11:16:38,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:38,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:38,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:38,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:38,197 INFO L87 Difference]: Start difference. First operand 7045 states and 11694 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:39,081 INFO L93 Difference]: Finished difference Result 20711 states and 34356 transitions. [2025-03-08 11:16:39,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:39,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:39,155 INFO L225 Difference]: With dead ends: 20711 [2025-03-08 11:16:39,155 INFO L226 Difference]: Without dead ends: 13669 [2025-03-08 11:16:39,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:39,179 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 375 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:39,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1252 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13669 states. [2025-03-08 11:16:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13669 to 13663. [2025-03-08 11:16:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13663 states, 9942 states have (on average 1.5477771072218869) internal successors, (15388), 10036 states have internal predecessors, (15388), 3620 states have call successors, (3620), 100 states have call predecessors, (3620), 100 states have return successors, (3620), 3526 states have call predecessors, (3620), 3620 states have call successors, (3620) [2025-03-08 11:16:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 22628 transitions. [2025-03-08 11:16:40,366 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 22628 transitions. Word has length 692 [2025-03-08 11:16:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:40,367 INFO L471 AbstractCegarLoop]: Abstraction has 13663 states and 22628 transitions. [2025-03-08 11:16:40,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 22628 transitions. [2025-03-08 11:16:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:40,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:40,392 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:40,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:16:40,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash -800093207, now seen corresponding path program 1 times [2025-03-08 11:16:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101848836] [2025-03-08 11:16:40,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:40,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:40,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:40,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:40,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101848836] [2025-03-08 11:16:41,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101848836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:41,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:41,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124307584] [2025-03-08 11:16:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:41,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:41,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:41,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:41,343 INFO L87 Difference]: Start difference. First operand 13663 states and 22628 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:42,464 INFO L93 Difference]: Finished difference Result 27345 states and 45290 transitions. [2025-03-08 11:16:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:16:42,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:42,527 INFO L225 Difference]: With dead ends: 27345 [2025-03-08 11:16:42,527 INFO L226 Difference]: Without dead ends: 13685 [2025-03-08 11:16:42,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:42,572 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 396 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:42,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1818 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:16:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13685 states. [2025-03-08 11:16:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13685 to 13679. [2025-03-08 11:16:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13679 states, 9958 states have (on average 1.5468969672625026) internal successors, (15404), 10052 states have internal predecessors, (15404), 3620 states have call successors, (3620), 100 states have call predecessors, (3620), 100 states have return successors, (3620), 3526 states have call predecessors, (3620), 3620 states have call successors, (3620) [2025-03-08 11:16:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13679 states to 13679 states and 22644 transitions. [2025-03-08 11:16:43,509 INFO L78 Accepts]: Start accepts. Automaton has 13679 states and 22644 transitions. Word has length 692 [2025-03-08 11:16:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:43,510 INFO L471 AbstractCegarLoop]: Abstraction has 13679 states and 22644 transitions. [2025-03-08 11:16:43,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 13679 states and 22644 transitions. [2025-03-08 11:16:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-08 11:16:43,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:43,527 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:43,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:16:43,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1008791510, now seen corresponding path program 1 times [2025-03-08 11:16:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293324135] [2025-03-08 11:16:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-08 11:16:43,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-08 11:16:43,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293324135] [2025-03-08 11:16:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293324135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:44,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:44,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:16:44,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082962389] [2025-03-08 11:16:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:44,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:16:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:44,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:16:44,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:16:44,656 INFO L87 Difference]: Start difference. First operand 13679 states and 22644 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:47,741 INFO L93 Difference]: Finished difference Result 40473 states and 66892 transitions. [2025-03-08 11:16:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:16:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-08 11:16:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:47,859 INFO L225 Difference]: With dead ends: 40473 [2025-03-08 11:16:47,860 INFO L226 Difference]: Without dead ends: 26789 [2025-03-08 11:16:47,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:16:47,909 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1409 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:47,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 3027 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 11:16:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2025-03-08 11:16:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 20433. [2025-03-08 11:16:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20433 states, 14944 states have (on average 1.5467077087794432) internal successors, (23114), 15086 states have internal predecessors, (23114), 5338 states have call successors, (5338), 150 states have call predecessors, (5338), 150 states have return successors, (5338), 5196 states have call predecessors, (5338), 5338 states have call successors, (5338) [2025-03-08 11:16:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 33790 transitions. [2025-03-08 11:16:49,377 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 33790 transitions. Word has length 692 [2025-03-08 11:16:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:49,378 INFO L471 AbstractCegarLoop]: Abstraction has 20433 states and 33790 transitions. [2025-03-08 11:16:49,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 33790 transitions. [2025-03-08 11:16:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-08 11:16:49,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:49,401 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:49,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:16:49,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -248152429, now seen corresponding path program 1 times [2025-03-08 11:16:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040096028] [2025-03-08 11:16:49,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:49,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-08 11:16:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-08 11:16:49,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:49,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:49,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040096028] [2025-03-08 11:16:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040096028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:49,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597195989] [2025-03-08 11:16:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:49,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:49,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:49,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:49,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:49,825 INFO L87 Difference]: Start difference. First operand 20433 states and 33790 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:51,404 INFO L93 Difference]: Finished difference Result 51312 states and 84913 transitions. [2025-03-08 11:16:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:16:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-08 11:16:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:51,537 INFO L225 Difference]: With dead ends: 51312 [2025-03-08 11:16:51,537 INFO L226 Difference]: Without dead ends: 30874 [2025-03-08 11:16:51,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:51,588 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 555 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:51,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 2205 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30874 states. [2025-03-08 11:16:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30874 to 21921. [2025-03-08 11:16:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21921 states, 16432 states have (on average 1.568524829600779) internal successors, (25774), 16574 states have internal predecessors, (25774), 5338 states have call successors, (5338), 150 states have call predecessors, (5338), 150 states have return successors, (5338), 5196 states have call predecessors, (5338), 5338 states have call successors, (5338) [2025-03-08 11:16:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21921 states to 21921 states and 36450 transitions. [2025-03-08 11:16:53,687 INFO L78 Accepts]: Start accepts. Automaton has 21921 states and 36450 transitions. Word has length 693 [2025-03-08 11:16:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:53,688 INFO L471 AbstractCegarLoop]: Abstraction has 21921 states and 36450 transitions. [2025-03-08 11:16:53,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21921 states and 36450 transitions. [2025-03-08 11:16:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-08 11:16:53,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:53,717 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:53,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:16:53,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash -905547371, now seen corresponding path program 1 times [2025-03-08 11:16:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144948626] [2025-03-08 11:16:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:53,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-08 11:16:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-08 11:16:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:53,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144948626] [2025-03-08 11:16:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144948626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:54,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:54,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:54,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839502892] [2025-03-08 11:16:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:54,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:54,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:54,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:54,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:54,157 INFO L87 Difference]: Start difference. First operand 21921 states and 36450 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:56,043 INFO L93 Difference]: Finished difference Result 64269 states and 106684 transitions. [2025-03-08 11:16:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-08 11:16:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:56,237 INFO L225 Difference]: With dead ends: 64269 [2025-03-08 11:16:56,237 INFO L226 Difference]: Without dead ends: 42351 [2025-03-08 11:16:56,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:56,452 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 380 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:56,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1109 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42351 states. [2025-03-08 11:16:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42351 to 42349. [2025-03-08 11:16:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42349 states, 31372 states have (on average 1.5578222618895832) internal successors, (48872), 31656 states have internal predecessors, (48872), 10676 states have call successors, (10676), 300 states have call predecessors, (10676), 300 states have return successors, (10676), 10392 states have call predecessors, (10676), 10676 states have call successors, (10676) [2025-03-08 11:16:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42349 states to 42349 states and 70224 transitions. [2025-03-08 11:16:59,019 INFO L78 Accepts]: Start accepts. Automaton has 42349 states and 70224 transitions. Word has length 693 [2025-03-08 11:16:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:59,020 INFO L471 AbstractCegarLoop]: Abstraction has 42349 states and 70224 transitions. [2025-03-08 11:16:59,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:16:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42349 states and 70224 transitions. [2025-03-08 11:16:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-08 11:16:59,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:59,052 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:59,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:16:59,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:59,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1203673708, now seen corresponding path program 1 times [2025-03-08 11:16:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:59,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117038728] [2025-03-08 11:16:59,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:59,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:59,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-08 11:16:59,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-08 11:16:59,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:59,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:16:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117038728] [2025-03-08 11:16:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117038728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437990643] [2025-03-08 11:16:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:59,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:59,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:59,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:59,682 INFO L87 Difference]: Start difference. First operand 42349 states and 70224 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:17:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:03,279 INFO L93 Difference]: Finished difference Result 103553 states and 171698 transitions. [2025-03-08 11:17:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:17:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-08 11:17:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:03,499 INFO L225 Difference]: With dead ends: 103553 [2025-03-08 11:17:03,499 INFO L226 Difference]: Without dead ends: 61207 [2025-03-08 11:17:03,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:17:03,609 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 204 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:03,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1104 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:17:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61207 states. [2025-03-08 11:17:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61207 to 43549. [2025-03-08 11:17:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43549 states, 32572 states have (on average 1.5722706619182119) internal successors, (51212), 32856 states have internal predecessors, (51212), 10676 states have call successors, (10676), 300 states have call predecessors, (10676), 300 states have return successors, (10676), 10392 states have call predecessors, (10676), 10676 states have call successors, (10676) [2025-03-08 11:17:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43549 states to 43549 states and 72564 transitions. [2025-03-08 11:17:06,619 INFO L78 Accepts]: Start accepts. Automaton has 43549 states and 72564 transitions. Word has length 693 [2025-03-08 11:17:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:06,620 INFO L471 AbstractCegarLoop]: Abstraction has 43549 states and 72564 transitions. [2025-03-08 11:17:06,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:17:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43549 states and 72564 transitions. [2025-03-08 11:17:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-08 11:17:06,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:06,651 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:17:06,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:17:06,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:06,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1102761741, now seen corresponding path program 1 times [2025-03-08 11:17:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285051537] [2025-03-08 11:17:06,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:06,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-08 11:17:06,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-08 11:17:06,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:06,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-08 11:17:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285051537] [2025-03-08 11:17:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285051537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:17:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32907847] [2025-03-08 11:17:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:07,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:17:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:07,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:17:07,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:07,615 INFO L87 Difference]: Start difference. First operand 43549 states and 72564 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:17:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:10,896 INFO L93 Difference]: Finished difference Result 112903 states and 189493 transitions. [2025-03-08 11:17:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:17:10,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-08 11:17:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:11,113 INFO L225 Difference]: With dead ends: 112903 [2025-03-08 11:17:11,114 INFO L226 Difference]: Without dead ends: 69357 [2025-03-08 11:17:11,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:17:11,218 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 541 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:11,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1977 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:17:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69357 states. [2025-03-08 11:17:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69357 to 65035. [2025-03-08 11:17:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65035 states, 53944 states have (on average 1.6343430223935933) internal successors, (88163), 54228 states have internal predecessors, (88163), 10784 states have call successors, (10784), 306 states have call predecessors, (10784), 306 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-03-08 11:17:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65035 states to 65035 states and 109731 transitions. [2025-03-08 11:17:14,635 INFO L78 Accepts]: Start accepts. Automaton has 65035 states and 109731 transitions. Word has length 693 [2025-03-08 11:17:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 65035 states and 109731 transitions. [2025-03-08 11:17:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-08 11:17:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 65035 states and 109731 transitions. [2025-03-08 11:17:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-08 11:17:14,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:14,673 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:17:14,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:17:14,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:14,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -597657129, now seen corresponding path program 1 times [2025-03-08 11:17:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515314977] [2025-03-08 11:17:14,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:14,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-08 11:17:15,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-08 11:17:15,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:15,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-08 11:17:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515314977] [2025-03-08 11:17:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515314977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:17:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723118453] [2025-03-08 11:17:15,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:15,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:17:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:15,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:17:15,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:17:15,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-08 11:17:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-08 11:17:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:15,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:17:15,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:17:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11357 proven. 186 refuted. 0 times theorem prover too weak. 11569 trivial. 0 not checked. [2025-03-08 11:17:16,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:17:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 135 proven. 186 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-08 11:17:16,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723118453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:17:16,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:17:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 11:17:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185047302] [2025-03-08 11:17:16,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:17:16,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:17:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:16,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:17:16,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:17:16,805 INFO L87 Difference]: Start difference. First operand 65035 states and 109731 transitions. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) [2025-03-08 11:17:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:21,146 INFO L93 Difference]: Finished difference Result 115727 states and 193516 transitions. [2025-03-08 11:17:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 11:17:21,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) Word has length 694 [2025-03-08 11:17:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:21,363 INFO L225 Difference]: With dead ends: 115727 [2025-03-08 11:17:21,363 INFO L226 Difference]: Without dead ends: 65941 [2025-03-08 11:17:21,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1412 GetRequests, 1384 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-03-08 11:17:21,489 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 920 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:21,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2022 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:17:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65941 states. [2025-03-08 11:17:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65941 to 62755. [2025-03-08 11:17:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62755 states, 51590 states have (on average 1.6176972281449893) internal successors, (83457), 51874 states have internal predecessors, (83457), 10784 states have call successors, (10784), 380 states have call predecessors, (10784), 380 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-03-08 11:17:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62755 states to 62755 states and 105025 transitions. [2025-03-08 11:17:25,632 INFO L78 Accepts]: Start accepts. Automaton has 62755 states and 105025 transitions. Word has length 694 [2025-03-08 11:17:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:25,633 INFO L471 AbstractCegarLoop]: Abstraction has 62755 states and 105025 transitions. [2025-03-08 11:17:25,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) [2025-03-08 11:17:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 62755 states and 105025 transitions. [2025-03-08 11:17:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-08 11:17:25,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:25,657 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:17:25,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:17:25,857 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,SelfDestructingSolverStorable14 [2025-03-08 11:17:25,858 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:25,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1622351050, now seen corresponding path program 1 times [2025-03-08 11:17:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560669854] [2025-03-08 11:17:25,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:25,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-08 11:17:26,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-08 11:17:26,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:26,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-08 11:17:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560669854] [2025-03-08 11:17:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560669854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:17:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768371538] [2025-03-08 11:17:26,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:17:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:26,515 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-08 11:17:26,517 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-08 11:17:26,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-08 11:17:26,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-08 11:17:26,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:26,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:26,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:17:26,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:17:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11357 proven. 186 refuted. 0 times theorem prover too weak. 11569 trivial. 0 not checked. [2025-03-08 11:17:27,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:17:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 135 proven. 186 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-08 11:17:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768371538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:17:27,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:17:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 11:17:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363212547] [2025-03-08 11:17:27,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:17:27,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:17:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:27,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:17:27,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:17:27,637 INFO L87 Difference]: Start difference. First operand 62755 states and 105025 transitions. Second operand has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236) [2025-03-08 11:17:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:32,066 INFO L93 Difference]: Finished difference Result 114679 states and 191028 transitions. [2025-03-08 11:17:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 11:17:32,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236) Word has length 694 [2025-03-08 11:17:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:32,286 INFO L225 Difference]: With dead ends: 114679 [2025-03-08 11:17:32,286 INFO L226 Difference]: Without dead ends: 63429 [2025-03-08 11:17:32,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1414 GetRequests, 1382 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2025-03-08 11:17:32,410 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 1241 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:32,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2326 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:17:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63429 states. [2025-03-08 11:17:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63429 to 61939. [2025-03-08 11:17:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61939 states, 50774 states have (on average 1.6143892543427738) internal successors, (81969), 51058 states have internal predecessors, (81969), 10784 states have call successors, (10784), 380 states have call predecessors, (10784), 380 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-03-08 11:17:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61939 states to 61939 states and 103537 transitions. [2025-03-08 11:17:36,087 INFO L78 Accepts]: Start accepts. Automaton has 61939 states and 103537 transitions. Word has length 694 [2025-03-08 11:17:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:36,088 INFO L471 AbstractCegarLoop]: Abstraction has 61939 states and 103537 transitions. [2025-03-08 11:17:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236) [2025-03-08 11:17:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 61939 states and 103537 transitions. [2025-03-08 11:17:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-08 11:17:36,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:36,121 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:17:36,131 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-08 11:17:36,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 11:17:36,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:36,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 497936149, now seen corresponding path program 1 times [2025-03-08 11:17:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:36,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435802034] [2025-03-08 11:17:36,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-08 11:17:36,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-08 11:17:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 153 proven. 168 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-08 11:17:37,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435802034] [2025-03-08 11:17:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435802034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:17:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856260332] [2025-03-08 11:17:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:37,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:17:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:37,058 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-08 11:17:37,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:17:37,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-08 11:17:37,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-08 11:17:37,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:37,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:37,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:17:37,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:17:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 10851 proven. 117 refuted. 0 times theorem prover too weak. 12144 trivial. 0 not checked. [2025-03-08 11:17:37,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:17:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 204 proven. 117 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-08 11:17:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856260332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:17:38,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:17:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2025-03-08 11:17:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078387074] [2025-03-08 11:17:38,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:17:38,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:17:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:38,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:17:38,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:17:38,039 INFO L87 Difference]: Start difference. First operand 61939 states and 103537 transitions. Second operand has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 3 states have call successors, (203), 2 states have call predecessors, (203), 4 states have return successors, (205), 3 states have call predecessors, (205), 3 states have call successors, (205)