./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-25.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 77ad24cb61a81820de21a387d3a45f445f59c8037143cf446293ba440ffb37aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:30:56,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:30:56,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:30:56,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:30:56,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:30:56,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:30:56,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:30:56,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:30:56,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:30:56,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:30:56,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:30:56,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:30:56,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:30:56,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:30:56,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:30:56,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:30:56,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:30:56,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:56,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:30:56,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:30:56,131 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 -> 77ad24cb61a81820de21a387d3a45f445f59c8037143cf446293ba440ffb37aa [2025-03-04 00:30:56,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:30:56,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:30:56,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:30:56,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:30:56,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:30:56,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-25.i [2025-03-04 00:30:57,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ed017e7/3211bd1cdc9a4e8e8f4942971557fdc6/FLAGf4efdb56f [2025-03-04 00:30:57,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:30:57,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-25.i [2025-03-04 00:30:57,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ed017e7/3211bd1cdc9a4e8e8f4942971557fdc6/FLAGf4efdb56f [2025-03-04 00:30:57,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ed017e7/3211bd1cdc9a4e8e8f4942971557fdc6 [2025-03-04 00:30:57,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:30:57,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:30:57,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:57,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:30:57,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:30:57,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:57" (1/1) ... [2025-03-04 00:30:57,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:57, skipping insertion in model container [2025-03-04 00:30:57,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:57" (1/1) ... [2025-03-04 00:30:57,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:30:58,064 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_operatoramount_amount500_file-25.i[916,929] [2025-03-04 00:30:58,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:58,228 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:30:58,235 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_operatoramount_amount500_file-25.i[916,929] [2025-03-04 00:30:58,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:58,345 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:30:58,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58 WrapperNode [2025-03-04 00:30:58,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:58,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:58,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:30:58,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:30:58,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,438 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 725 [2025-03-04 00:30:58,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:58,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:30:58,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:30:58,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:30:58,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,508 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-04 00:30:58,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:30:58,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:30:58,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:30:58,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:30:58,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (1/1) ... [2025-03-04 00:30:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:58,599 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-04 00:30:58,624 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-04 00:30:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:30:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:30:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:30:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:30:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:30:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:30:58,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:30:58,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:30:59,676 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L638: havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~bitwise52#1;havoc property_#t~short53#1;havoc property_#t~ite56#1;havoc property_#t~bitwise54#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-04 00:30:59,797 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-04 00:30:59,798 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:30:59,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:30:59,830 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:30:59,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:59 BoogieIcfgContainer [2025-03-04 00:30:59,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:30:59,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:30:59,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:30:59,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:30:59,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:30:57" (1/3) ... [2025-03-04 00:30:59,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799059bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:59, skipping insertion in model container [2025-03-04 00:30:59,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:58" (2/3) ... [2025-03-04 00:30:59,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799059bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:59, skipping insertion in model container [2025-03-04 00:30:59,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:59" (3/3) ... [2025-03-04 00:30:59,840 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-25.i [2025-03-04 00:30:59,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:30:59,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-25.i that has 2 procedures, 278 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:30:59,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:30:59,929 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;@5466e507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:30:59,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:30:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 278 states, 207 states have (on average 1.536231884057971) internal successors, (318), 208 states have internal predecessors, (318), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:30:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:30:59,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:59,955 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:59,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:59,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1176969774, now seen corresponding path program 1 times [2025-03-04 00:30:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:59,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295054520] [2025-03-04 00:30:59,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:00,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:31:00,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:31:00,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:00,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-04 00:31:00,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295054520] [2025-03-04 00:31:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295054520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222376181] [2025-03-04 00:31:00,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:00,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:00,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:00,550 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-04 00:31:00,552 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-04 00:31:00,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:31:00,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:31:00,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:00,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:31:00,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-04 00:31:00,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:31:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222376181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:31:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:31:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695037659] [2025-03-04 00:31:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:31:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:00,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:31:00,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:31:00,990 INFO L87 Difference]: Start difference. First operand has 278 states, 207 states have (on average 1.536231884057971) internal successors, (318), 208 states have internal predecessors, (318), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:31:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:01,065 INFO L93 Difference]: Finished difference Result 550 states and 971 transitions. [2025-03-04 00:31:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:31:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 472 [2025-03-04 00:31:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:01,074 INFO L225 Difference]: With dead ends: 550 [2025-03-04 00:31:01,074 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 00:31:01,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 473 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-04 00:31:01,083 INFO L435 NwaCegarLoop]: 437 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, 437 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-04 00:31:01,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 00:31:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-04 00:31:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:31:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 449 transitions. [2025-03-04 00:31:01,157 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 449 transitions. Word has length 472 [2025-03-04 00:31:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 449 transitions. [2025-03-04 00:31:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:31:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 449 transitions. [2025-03-04 00:31:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:31:01,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:01,172 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:01,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:01,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:31:01,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:01,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -44023988, now seen corresponding path program 1 times [2025-03-04 00:31:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358797699] [2025-03-04 00:31:01,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:31:01,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:31:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:01,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358797699] [2025-03-04 00:31:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358797699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:01,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254494830] [2025-03-04 00:31:01,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:01,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:01,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:01,899 INFO L87 Difference]: Start difference. First operand 275 states and 449 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:02,021 INFO L93 Difference]: Finished difference Result 687 states and 1126 transitions. [2025-03-04 00:31:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:02,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 472 [2025-03-04 00:31:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:02,026 INFO L225 Difference]: With dead ends: 687 [2025-03-04 00:31:02,026 INFO L226 Difference]: Without dead ends: 415 [2025-03-04 00:31:02,027 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-04 00:31:02,027 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 236 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:02,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1028 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-04 00:31:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 381. [2025-03-04 00:31:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 311 states have (on average 1.5916398713826367) internal successors, (495), 311 states have internal predecessors, (495), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:31:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 631 transitions. [2025-03-04 00:31:02,070 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 631 transitions. Word has length 472 [2025-03-04 00:31:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:02,073 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 631 transitions. [2025-03-04 00:31:02,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 631 transitions. [2025-03-04 00:31:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:31:02,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:02,083 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:02,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:31:02,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:02,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 37678411, now seen corresponding path program 1 times [2025-03-04 00:31:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087298021] [2025-03-04 00:31:02,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:02,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:31:02,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:31:02,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:02,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087298021] [2025-03-04 00:31:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087298021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:02,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122249180] [2025-03-04 00:31:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:02,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:02,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:02,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:02,482 INFO L87 Difference]: Start difference. First operand 381 states and 631 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:02,597 INFO L93 Difference]: Finished difference Result 1137 states and 1887 transitions. [2025-03-04 00:31:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 472 [2025-03-04 00:31:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:02,606 INFO L225 Difference]: With dead ends: 1137 [2025-03-04 00:31:02,608 INFO L226 Difference]: Without dead ends: 759 [2025-03-04 00:31:02,609 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-04 00:31:02,610 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 410 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:02,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 993 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-04 00:31:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2025-03-04 00:31:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 618 states have (on average 1.5825242718446602) internal successors, (978), 618 states have internal predecessors, (978), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-04 00:31:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1250 transitions. [2025-03-04 00:31:02,693 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1250 transitions. Word has length 472 [2025-03-04 00:31:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:02,694 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1250 transitions. [2025-03-04 00:31:02,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1250 transitions. [2025-03-04 00:31:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:31:02,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:02,702 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:31:02,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:02,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash 918263437, now seen corresponding path program 1 times [2025-03-04 00:31:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:02,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792081054] [2025-03-04 00:31:02,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:02,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:31:02,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:31:02,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:02,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792081054] [2025-03-04 00:31:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792081054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701361214] [2025-03-04 00:31:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:03,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:03,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:03,346 INFO L87 Difference]: Start difference. First operand 757 states and 1250 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:03,428 INFO L93 Difference]: Finished difference Result 1515 states and 2505 transitions. [2025-03-04 00:31:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:03,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 472 [2025-03-04 00:31:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:03,436 INFO L225 Difference]: With dead ends: 1515 [2025-03-04 00:31:03,436 INFO L226 Difference]: Without dead ends: 761 [2025-03-04 00:31:03,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:03,441 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 3 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:03,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1293 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-04 00:31:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2025-03-04 00:31:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 622 states have (on average 1.5787781350482315) internal successors, (982), 622 states have internal predecessors, (982), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-04 00:31:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1254 transitions. [2025-03-04 00:31:03,502 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1254 transitions. Word has length 472 [2025-03-04 00:31:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:03,505 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1254 transitions. [2025-03-04 00:31:03,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1254 transitions. [2025-03-04 00:31:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 00:31:03,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:03,511 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:31:03,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1548722062, now seen corresponding path program 1 times [2025-03-04 00:31:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766717594] [2025-03-04 00:31:03,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 00:31:03,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 00:31:03,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:03,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766717594] [2025-03-04 00:31:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766717594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456339693] [2025-03-04 00:31:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:04,217 INFO L87 Difference]: Start difference. First operand 761 states and 1254 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:04,340 INFO L93 Difference]: Finished difference Result 1527 states and 2517 transitions. [2025-03-04 00:31:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 472 [2025-03-04 00:31:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:04,347 INFO L225 Difference]: With dead ends: 1527 [2025-03-04 00:31:04,347 INFO L226 Difference]: Without dead ends: 769 [2025-03-04 00:31:04,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:04,350 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 437 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:04,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1269 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-04 00:31:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2025-03-04 00:31:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 630 states have (on average 1.5714285714285714) internal successors, (990), 630 states have internal predecessors, (990), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-04 00:31:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1262 transitions. [2025-03-04 00:31:04,428 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1262 transitions. Word has length 472 [2025-03-04 00:31:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:04,430 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1262 transitions. [2025-03-04 00:31:04,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1262 transitions. [2025-03-04 00:31:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:31:04,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:04,439 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:04,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:31:04,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:04,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1253082927, now seen corresponding path program 1 times [2025-03-04 00:31:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457347600] [2025-03-04 00:31:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:04,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:31:04,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:31:04,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:04,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:04,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:04,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457347600] [2025-03-04 00:31:04,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457347600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:04,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:31:04,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009894008] [2025-03-04 00:31:04,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:04,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:31:04,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:04,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:31:04,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:04,961 INFO L87 Difference]: Start difference. First operand 769 states and 1262 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:31:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:05,842 INFO L93 Difference]: Finished difference Result 3357 states and 5482 transitions. [2025-03-04 00:31:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:31:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) Word has length 473 [2025-03-04 00:31:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:05,858 INFO L225 Difference]: With dead ends: 3357 [2025-03-04 00:31:05,858 INFO L226 Difference]: Without dead ends: 2591 [2025-03-04 00:31:05,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:31:05,862 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1725 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:05,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 2705 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:31:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-04 00:31:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 1729. [2025-03-04 00:31:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1450 states have (on average 1.576551724137931) internal successors, (2286), 1450 states have internal predecessors, (2286), 272 states have call successors, (272), 6 states have call predecessors, (272), 6 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-04 00:31:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2830 transitions. [2025-03-04 00:31:06,059 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2830 transitions. Word has length 473 [2025-03-04 00:31:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:06,060 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2830 transitions. [2025-03-04 00:31:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:31:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2830 transitions. [2025-03-04 00:31:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-04 00:31:06,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:06,067 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:06,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:31:06,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:06,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1373392880, now seen corresponding path program 1 times [2025-03-04 00:31:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330813628] [2025-03-04 00:31:06,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:06,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-04 00:31:06,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-04 00:31:06,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:06,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:06,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330813628] [2025-03-04 00:31:06,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330813628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:06,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:06,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665766034] [2025-03-04 00:31:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:06,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:06,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:06,604 INFO L87 Difference]: Start difference. First operand 1729 states and 2830 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:06,977 INFO L93 Difference]: Finished difference Result 5325 states and 8681 transitions. [2025-03-04 00:31:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:06,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 473 [2025-03-04 00:31:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:06,993 INFO L225 Difference]: With dead ends: 5325 [2025-03-04 00:31:06,994 INFO L226 Difference]: Without dead ends: 3599 [2025-03-04 00:31:06,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-04 00:31:06,999 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 551 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:06,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1442 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-04 00:31:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2917. [2025-03-04 00:31:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2360 states have (on average 1.5432203389830508) internal successors, (3642), 2360 states have internal predecessors, (3642), 544 states have call successors, (544), 12 states have call predecessors, (544), 12 states have return successors, (544), 544 states have call predecessors, (544), 544 states have call successors, (544) [2025-03-04 00:31:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4730 transitions. [2025-03-04 00:31:07,247 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4730 transitions. Word has length 473 [2025-03-04 00:31:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:07,247 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4730 transitions. [2025-03-04 00:31:07,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4730 transitions. [2025-03-04 00:31:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-04 00:31:07,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:07,256 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:07,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:31:07,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1051172626, now seen corresponding path program 1 times [2025-03-04 00:31:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952003171] [2025-03-04 00:31:07,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:07,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-04 00:31:07,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-04 00:31:07,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:07,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952003171] [2025-03-04 00:31:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952003171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646031825] [2025-03-04 00:31:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:07,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:07,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:07,612 INFO L87 Difference]: Start difference. First operand 2917 states and 4730 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:07,998 INFO L93 Difference]: Finished difference Result 7168 states and 11584 transitions. [2025-03-04 00:31:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 475 [2025-03-04 00:31:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:08,017 INFO L225 Difference]: With dead ends: 7168 [2025-03-04 00:31:08,018 INFO L226 Difference]: Without dead ends: 4254 [2025-03-04 00:31:08,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:08,025 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 437 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:08,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1256 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2025-03-04 00:31:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 3964. [2025-03-04 00:31:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3337 states have (on average 1.5624812706023374) internal successors, (5214), 3337 states have internal predecessors, (5214), 612 states have call successors, (612), 14 states have call predecessors, (612), 14 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:31:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 6438 transitions. [2025-03-04 00:31:08,276 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 6438 transitions. Word has length 475 [2025-03-04 00:31:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 3964 states and 6438 transitions. [2025-03-04 00:31:08,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 6438 transitions. [2025-03-04 00:31:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-04 00:31:08,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:08,281 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:08,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:31:08,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:08,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1024794648, now seen corresponding path program 1 times [2025-03-04 00:31:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44008680] [2025-03-04 00:31:08,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:08,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-04 00:31:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-04 00:31:08,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:08,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44008680] [2025-03-04 00:31:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44008680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365835393] [2025-03-04 00:31:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:08,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:08,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:08,626 INFO L87 Difference]: Start difference. First operand 3964 states and 6438 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:09,033 INFO L93 Difference]: Finished difference Result 6428 states and 10416 transitions. [2025-03-04 00:31:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 476 [2025-03-04 00:31:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:09,053 INFO L225 Difference]: With dead ends: 6428 [2025-03-04 00:31:09,053 INFO L226 Difference]: Without dead ends: 4256 [2025-03-04 00:31:09,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:09,061 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 438 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:09,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1672 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2025-03-04 00:31:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 3966. [2025-03-04 00:31:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3339 states have (on average 1.5621443545971847) internal successors, (5216), 3339 states have internal predecessors, (5216), 612 states have call successors, (612), 14 states have call predecessors, (612), 14 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:31:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 6440 transitions. [2025-03-04 00:31:09,272 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 6440 transitions. Word has length 476 [2025-03-04 00:31:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 3966 states and 6440 transitions. [2025-03-04 00:31:09,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 6440 transitions. [2025-03-04 00:31:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-04 00:31:09,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:09,279 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:09,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:31:09,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:09,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1161139399, now seen corresponding path program 1 times [2025-03-04 00:31:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755297062] [2025-03-04 00:31:09,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:09,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-04 00:31:09,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-04 00:31:09,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:09,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755297062] [2025-03-04 00:31:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755297062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:09,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:09,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761908736] [2025-03-04 00:31:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:09,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:09,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:09,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:09,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:09,712 INFO L87 Difference]: Start difference. First operand 3966 states and 6440 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:10,055 INFO L93 Difference]: Finished difference Result 8092 states and 13085 transitions. [2025-03-04 00:31:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:10,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 476 [2025-03-04 00:31:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:10,086 INFO L225 Difference]: With dead ends: 8092 [2025-03-04 00:31:10,087 INFO L226 Difference]: Without dead ends: 4255 [2025-03-04 00:31:10,095 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-04 00:31:10,096 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 333 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:10,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1271 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2025-03-04 00:31:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3965. [2025-03-04 00:31:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3338 states have (on average 1.5620131815458358) internal successors, (5214), 3338 states have internal predecessors, (5214), 612 states have call successors, (612), 14 states have call predecessors, (612), 14 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:31:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 6438 transitions. [2025-03-04 00:31:10,430 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 6438 transitions. Word has length 476 [2025-03-04 00:31:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:10,431 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 6438 transitions. [2025-03-04 00:31:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 6438 transitions. [2025-03-04 00:31:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-04 00:31:10,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:10,437 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:10,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:31:10,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:10,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1056910150, now seen corresponding path program 1 times [2025-03-04 00:31:10,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687259706] [2025-03-04 00:31:10,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:10,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:10,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-04 00:31:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-04 00:31:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687259706] [2025-03-04 00:31:10,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687259706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:10,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:10,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:10,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753128242] [2025-03-04 00:31:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:10,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:10,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:10,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:10,896 INFO L87 Difference]: Start difference. First operand 3965 states and 6438 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:11,367 INFO L93 Difference]: Finished difference Result 7609 states and 12286 transitions. [2025-03-04 00:31:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 476 [2025-03-04 00:31:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:11,383 INFO L225 Difference]: With dead ends: 7609 [2025-03-04 00:31:11,384 INFO L226 Difference]: Without dead ends: 4253 [2025-03-04 00:31:11,393 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-04 00:31:11,393 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 368 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:11,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1244 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2025-03-04 00:31:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 3971. [2025-03-04 00:31:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3344 states have (on average 1.5604066985645932) internal successors, (5218), 3344 states have internal predecessors, (5218), 612 states have call successors, (612), 14 states have call predecessors, (612), 14 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:31:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 6442 transitions. [2025-03-04 00:31:11,601 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 6442 transitions. Word has length 476 [2025-03-04 00:31:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:11,602 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 6442 transitions. [2025-03-04 00:31:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 6442 transitions. [2025-03-04 00:31:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:31:11,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:11,606 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:11,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:31:11,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1734154250, now seen corresponding path program 1 times [2025-03-04 00:31:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321610673] [2025-03-04 00:31:11,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:11,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:31:11,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:31:11,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:11,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321610673] [2025-03-04 00:31:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321610673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310725741] [2025-03-04 00:31:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:11,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:11,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:11,891 INFO L87 Difference]: Start difference. First operand 3971 states and 6442 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:11,990 INFO L93 Difference]: Finished difference Result 6157 states and 10031 transitions. [2025-03-04 00:31:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 477 [2025-03-04 00:31:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:12,003 INFO L225 Difference]: With dead ends: 6157 [2025-03-04 00:31:12,003 INFO L226 Difference]: Without dead ends: 3981 [2025-03-04 00:31:12,008 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-04 00:31:12,008 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:12,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 864 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2025-03-04 00:31:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2025-03-04 00:31:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3354 states have (on average 1.5587358378056053) internal successors, (5228), 3354 states have internal predecessors, (5228), 612 states have call successors, (612), 14 states have call predecessors, (612), 14 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:31:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 6452 transitions. [2025-03-04 00:31:12,142 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 6452 transitions. Word has length 477 [2025-03-04 00:31:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:12,144 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 6452 transitions. [2025-03-04 00:31:12,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 6452 transitions. [2025-03-04 00:31:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:31:12,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:12,147 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:12,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:31:12,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 451779797, now seen corresponding path program 1 times [2025-03-04 00:31:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218945270] [2025-03-04 00:31:12,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:12,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:31:12,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:31:12,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:12,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:12,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218945270] [2025-03-04 00:31:12,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218945270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:12,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:12,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19542942] [2025-03-04 00:31:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:12,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:12,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:12,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:12,658 INFO L87 Difference]: Start difference. First operand 3981 states and 6452 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:13,178 INFO L93 Difference]: Finished difference Result 7629 states and 12296 transitions. [2025-03-04 00:31:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 477 [2025-03-04 00:31:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:13,192 INFO L225 Difference]: With dead ends: 7629 [2025-03-04 00:31:13,192 INFO L226 Difference]: Without dead ends: 4261 [2025-03-04 00:31:13,200 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-04 00:31:13,201 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 364 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1226 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:31:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2025-03-04 00:31:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 3987. [2025-03-04 00:31:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3360 states have (on average 1.5571428571428572) internal successors, (5232), 3360 states have internal predecessors, (5232), 612 states have call successors, (612), 14 states have call predecessors, (612), 14 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:31:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 6456 transitions. [2025-03-04 00:31:13,396 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 6456 transitions. Word has length 477 [2025-03-04 00:31:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:13,397 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 6456 transitions. [2025-03-04 00:31:13,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 6456 transitions. [2025-03-04 00:31:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:31:13,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:13,401 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:13,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:31:13,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:13,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1202595003, now seen corresponding path program 1 times [2025-03-04 00:31:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:13,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562934609] [2025-03-04 00:31:13,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:13,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:13,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:31:13,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:31:13,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:13,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562934609] [2025-03-04 00:31:14,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562934609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:31:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284947076] [2025-03-04 00:31:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:31:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:14,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:31:14,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:14,231 INFO L87 Difference]: Start difference. First operand 3987 states and 6456 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:15,124 INFO L93 Difference]: Finished difference Result 13123 states and 21310 transitions. [2025-03-04 00:31:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:31:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 478 [2025-03-04 00:31:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:15,158 INFO L225 Difference]: With dead ends: 13123 [2025-03-04 00:31:15,158 INFO L226 Difference]: Without dead ends: 9909 [2025-03-04 00:31:15,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:31:15,173 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 521 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:15,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2853 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:31:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9909 states. [2025-03-04 00:31:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9909 to 7927. [2025-03-04 00:31:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7927 states, 6744 states have (on average 1.574288256227758) internal successors, (10617), 6744 states have internal predecessors, (10617), 1156 states have call successors, (1156), 26 states have call predecessors, (1156), 26 states have return successors, (1156), 1156 states have call predecessors, (1156), 1156 states have call successors, (1156) [2025-03-04 00:31:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7927 states to 7927 states and 12929 transitions. [2025-03-04 00:31:15,575 INFO L78 Accepts]: Start accepts. Automaton has 7927 states and 12929 transitions. Word has length 478 [2025-03-04 00:31:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:15,576 INFO L471 AbstractCegarLoop]: Abstraction has 7927 states and 12929 transitions. [2025-03-04 00:31:15,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 12929 transitions. [2025-03-04 00:31:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:31:15,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:15,581 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:15,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:31:15,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:15,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -382345638, now seen corresponding path program 1 times [2025-03-04 00:31:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257038089] [2025-03-04 00:31:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:31:16,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:31:16,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:16,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257038089] [2025-03-04 00:31:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257038089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:31:17,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499915450] [2025-03-04 00:31:17,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:17,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:31:17,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:17,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:31:17,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:31:17,880 INFO L87 Difference]: Start difference. First operand 7927 states and 12929 transitions. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 3 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2025-03-04 00:31:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:20,016 INFO L93 Difference]: Finished difference Result 25108 states and 40304 transitions. [2025-03-04 00:31:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:31:20,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 3 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) Word has length 479 [2025-03-04 00:31:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:20,064 INFO L225 Difference]: With dead ends: 25108 [2025-03-04 00:31:20,064 INFO L226 Difference]: Without dead ends: 17509 [2025-03-04 00:31:20,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:31:20,084 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 2106 mSDsluCounter, 2573 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2106 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:20,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2106 Valid, 3067 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:31:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2025-03-04 00:31:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 10293. [2025-03-04 00:31:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10293 states, 9110 states have (on average 1.5864983534577388) internal successors, (14453), 9110 states have internal predecessors, (14453), 1156 states have call successors, (1156), 26 states have call predecessors, (1156), 26 states have return successors, (1156), 1156 states have call predecessors, (1156), 1156 states have call successors, (1156) [2025-03-04 00:31:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10293 states to 10293 states and 16765 transitions. [2025-03-04 00:31:20,614 INFO L78 Accepts]: Start accepts. Automaton has 10293 states and 16765 transitions. Word has length 479 [2025-03-04 00:31:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:20,615 INFO L471 AbstractCegarLoop]: Abstraction has 10293 states and 16765 transitions. [2025-03-04 00:31:20,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 3 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2025-03-04 00:31:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10293 states and 16765 transitions. [2025-03-04 00:31:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:31:20,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:20,625 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:20,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:31:20,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:20,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -990422501, now seen corresponding path program 1 times [2025-03-04 00:31:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778462301] [2025-03-04 00:31:20,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:20,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:31:20,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:31:20,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:20,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778462301] [2025-03-04 00:31:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778462301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:31:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075273023] [2025-03-04 00:31:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:21,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:31:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:21,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:31:21,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:21,656 INFO L87 Difference]: Start difference. First operand 10293 states and 16765 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:22,772 INFO L93 Difference]: Finished difference Result 29497 states and 47792 transitions. [2025-03-04 00:31:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:31:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-04 00:31:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:22,839 INFO L225 Difference]: With dead ends: 29497 [2025-03-04 00:31:22,839 INFO L226 Difference]: Without dead ends: 21559 [2025-03-04 00:31:22,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:31:22,861 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 1403 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:22,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 3176 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:31:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21559 states. [2025-03-04 00:31:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21559 to 10293. [2025-03-04 00:31:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10293 states, 9110 states have (on average 1.5864983534577388) internal successors, (14453), 9110 states have internal predecessors, (14453), 1156 states have call successors, (1156), 26 states have call predecessors, (1156), 26 states have return successors, (1156), 1156 states have call predecessors, (1156), 1156 states have call successors, (1156) [2025-03-04 00:31:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10293 states to 10293 states and 16765 transitions. [2025-03-04 00:31:23,627 INFO L78 Accepts]: Start accepts. Automaton has 10293 states and 16765 transitions. Word has length 479 [2025-03-04 00:31:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:23,628 INFO L471 AbstractCegarLoop]: Abstraction has 10293 states and 16765 transitions. [2025-03-04 00:31:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 10293 states and 16765 transitions. [2025-03-04 00:31:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:31:23,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:23,637 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:23,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:31:23,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:23,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash 293346971, now seen corresponding path program 1 times [2025-03-04 00:31:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972288309] [2025-03-04 00:31:23,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:23,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:31:24,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:31:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:25,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972288309] [2025-03-04 00:31:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972288309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:31:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599800458] [2025-03-04 00:31:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:25,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:31:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:25,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:31:25,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:31:25,029 INFO L87 Difference]: Start difference. First operand 10293 states and 16765 transitions. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:27,812 INFO L93 Difference]: Finished difference Result 28727 states and 46872 transitions. [2025-03-04 00:31:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:31:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-04 00:31:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:27,863 INFO L225 Difference]: With dead ends: 28727 [2025-03-04 00:31:27,863 INFO L226 Difference]: Without dead ends: 19863 [2025-03-04 00:31:27,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:31:27,883 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 2528 mSDsluCounter, 3650 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2528 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1227 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:27,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2528 Valid, 4624 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1227 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:31:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19863 states. [2025-03-04 00:31:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19863 to 12704. [2025-03-04 00:31:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12704 states, 11521 states have (on average 1.567051471226456) internal successors, (18054), 11521 states have internal predecessors, (18054), 1156 states have call successors, (1156), 26 states have call predecessors, (1156), 26 states have return successors, (1156), 1156 states have call predecessors, (1156), 1156 states have call successors, (1156) [2025-03-04 00:31:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 20366 transitions. [2025-03-04 00:31:28,720 INFO L78 Accepts]: Start accepts. Automaton has 12704 states and 20366 transitions. Word has length 479 [2025-03-04 00:31:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:28,721 INFO L471 AbstractCegarLoop]: Abstraction has 12704 states and 20366 transitions. [2025-03-04 00:31:28,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 12704 states and 20366 transitions. [2025-03-04 00:31:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-04 00:31:28,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:28,730 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:28,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:31:28,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:28,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash -467727681, now seen corresponding path program 1 times [2025-03-04 00:31:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596411628] [2025-03-04 00:31:28,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:28,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:31:29,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:31:29,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:29,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 42 proven. 159 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-04 00:31:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596411628] [2025-03-04 00:31:29,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596411628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146410892] [2025-03-04 00:31:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:29,901 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-04 00:31:29,903 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-04 00:31:30,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:31:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:31:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:30,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:30,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:31:30,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 3063 proven. 159 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2025-03-04 00:31:31,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 42 proven. 159 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-04 00:31:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146410892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:31,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:31,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-03-04 00:31:31,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527996589] [2025-03-04 00:31:31,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:31,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:31:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:31,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:31:31,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:31:31,547 INFO L87 Difference]: Start difference. First operand 12704 states and 20366 transitions. Second operand has 18 states, 18 states have (on average 13.38888888888889) internal successors, (241), 18 states have internal predecessors, (241), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (204), 5 states have call predecessors, (204), 5 states have call successors, (204) [2025-03-04 00:31:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:33,953 INFO L93 Difference]: Finished difference Result 36433 states and 58459 transitions. [2025-03-04 00:31:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:31:33,954 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.38888888888889) internal successors, (241), 18 states have internal predecessors, (241), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (204), 5 states have call predecessors, (204), 5 states have call successors, (204) Word has length 480 [2025-03-04 00:31:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:34,007 INFO L225 Difference]: With dead ends: 36433 [2025-03-04 00:31:34,007 INFO L226 Difference]: Without dead ends: 23856 [2025-03-04 00:31:34,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:31:34,028 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1870 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:34,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 2929 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:31:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23856 states. [2025-03-04 00:31:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23856 to 21200. [2025-03-04 00:31:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21200 states, 18888 states have (on average 1.5603557814485387) internal successors, (29472), 18888 states have internal predecessors, (29472), 2244 states have call successors, (2244), 67 states have call predecessors, (2244), 67 states have return successors, (2244), 2244 states have call predecessors, (2244), 2244 states have call successors, (2244) [2025-03-04 00:31:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 33960 transitions. [2025-03-04 00:31:35,415 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 33960 transitions. Word has length 480 [2025-03-04 00:31:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:35,415 INFO L471 AbstractCegarLoop]: Abstraction has 21200 states and 33960 transitions. [2025-03-04 00:31:35,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.38888888888889) internal successors, (241), 18 states have internal predecessors, (241), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (204), 5 states have call predecessors, (204), 5 states have call successors, (204) [2025-03-04 00:31:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 33960 transitions. [2025-03-04 00:31:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-04 00:31:35,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:35,427 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:35,436 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-04 00:31:35,627 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,SelfDestructingSolverStorable17 [2025-03-04 00:31:35,628 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:35,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -211294761, now seen corresponding path program 1 times [2025-03-04 00:31:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:35,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118101694] [2025-03-04 00:31:35,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:35,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:31:35,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:31:35,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:35,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:35,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:35,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118101694] [2025-03-04 00:31:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118101694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:35,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840145481] [2025-03-04 00:31:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:35,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:35,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:35,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:35,983 INFO L87 Difference]: Start difference. First operand 21200 states and 33960 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:37,315 INFO L93 Difference]: Finished difference Result 51498 states and 82411 transitions. [2025-03-04 00:31:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:37,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 481 [2025-03-04 00:31:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:37,377 INFO L225 Difference]: With dead ends: 51498 [2025-03-04 00:31:37,377 INFO L226 Difference]: Without dead ends: 30429 [2025-03-04 00:31:37,407 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-04 00:31:37,408 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 551 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:37,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1499 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30429 states. [2025-03-04 00:31:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30429 to 26295. [2025-03-04 00:31:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26295 states, 23423 states have (on average 1.5582547069120096) internal successors, (36499), 23423 states have internal predecessors, (36499), 2788 states have call successors, (2788), 83 states have call predecessors, (2788), 83 states have return successors, (2788), 2788 states have call predecessors, (2788), 2788 states have call successors, (2788) [2025-03-04 00:31:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26295 states to 26295 states and 42075 transitions. [2025-03-04 00:31:39,501 INFO L78 Accepts]: Start accepts. Automaton has 26295 states and 42075 transitions. Word has length 481 [2025-03-04 00:31:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 26295 states and 42075 transitions. [2025-03-04 00:31:39,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 26295 states and 42075 transitions. [2025-03-04 00:31:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-04 00:31:39,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:39,517 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:31:39,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1020782218, now seen corresponding path program 1 times [2025-03-04 00:31:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669385847] [2025-03-04 00:31:39,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:39,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:31:40,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:31:40,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:40,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 114 proven. 471 refuted. 0 times theorem prover too weak. 8527 trivial. 0 not checked. [2025-03-04 00:31:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669385847] [2025-03-04 00:31:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669385847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822594220] [2025-03-04 00:31:41,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:41,411 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-04 00:31:41,412 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-04 00:31:41,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:31:41,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:31:41,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:41,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:41,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:31:41,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 3692 proven. 306 refuted. 0 times theorem prover too weak. 5114 trivial. 0 not checked. [2025-03-04 00:31:43,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 90 proven. 309 refuted. 0 times theorem prover too weak. 8713 trivial. 0 not checked. [2025-03-04 00:31:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822594220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:45,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2025-03-04 00:31:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679866358] [2025-03-04 00:31:45,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:45,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 00:31:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:45,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 00:31:45,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:31:45,192 INFO L87 Difference]: Start difference. First operand 26295 states and 42075 transitions. Second operand has 24 states, 24 states have (on average 16.333333333333332) internal successors, (392), 24 states have internal predecessors, (392), 10 states have call successors, (184), 4 states have call predecessors, (184), 9 states have return successors, (184), 10 states have call predecessors, (184), 10 states have call successors, (184) [2025-03-04 00:31:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:48,745 INFO L93 Difference]: Finished difference Result 63521 states and 100237 transitions. [2025-03-04 00:31:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:31:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 16.333333333333332) internal successors, (392), 24 states have internal predecessors, (392), 10 states have call successors, (184), 4 states have call predecessors, (184), 9 states have return successors, (184), 10 states have call predecessors, (184), 10 states have call successors, (184) Word has length 481 [2025-03-04 00:31:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:48,838 INFO L225 Difference]: With dead ends: 63521 [2025-03-04 00:31:48,838 INFO L226 Difference]: Without dead ends: 44811 [2025-03-04 00:31:48,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 955 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=678, Invalid=1872, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 00:31:48,875 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 3557 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3558 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 742 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:48,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3558 Valid, 2214 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [742 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:31:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44811 states. [2025-03-04 00:31:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44811 to 39309. [2025-03-04 00:31:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39309 states, 35674 states have (on average 1.5598755396086785) internal successors, (55647), 35714 states have internal predecessors, (55647), 3348 states have call successors, (3348), 286 states have call predecessors, (3348), 286 states have return successors, (3348), 3308 states have call predecessors, (3348), 3348 states have call successors, (3348) [2025-03-04 00:31:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39309 states to 39309 states and 62343 transitions. [2025-03-04 00:31:51,872 INFO L78 Accepts]: Start accepts. Automaton has 39309 states and 62343 transitions. Word has length 481 [2025-03-04 00:31:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:51,873 INFO L471 AbstractCegarLoop]: Abstraction has 39309 states and 62343 transitions. [2025-03-04 00:31:51,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 16.333333333333332) internal successors, (392), 24 states have internal predecessors, (392), 10 states have call successors, (184), 4 states have call predecessors, (184), 9 states have return successors, (184), 10 states have call predecessors, (184), 10 states have call successors, (184) [2025-03-04 00:31:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 39309 states and 62343 transitions. [2025-03-04 00:31:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-04 00:31:51,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:51,895 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:51,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:31:52,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:52,096 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1236128789, now seen corresponding path program 1 times [2025-03-04 00:31:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004904329] [2025-03-04 00:31:52,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:52,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:31:53,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:31:53,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:53,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:31:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325328000] [2025-03-04 00:31:53,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:53,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:53,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:31:53,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:31:53,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:31:53,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:53,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:53,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:31:53,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:31:54,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:31:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:54,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004904329] [2025-03-04 00:31:54,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:31:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325328000] [2025-03-04 00:31:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325328000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:54,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237766915] [2025-03-04 00:31:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:54,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:54,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:54,298 INFO L87 Difference]: Start difference. First operand 39309 states and 62343 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:31:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:59,193 INFO L93 Difference]: Finished difference Result 138447 states and 220225 transitions. [2025-03-04 00:31:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:31:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 481 [2025-03-04 00:31:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:59,424 INFO L225 Difference]: With dead ends: 138447 [2025-03-04 00:31:59,424 INFO L226 Difference]: Without dead ends: 110527 [2025-03-04 00:31:59,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:59,491 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 496 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:59,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1667 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110527 states. [2025-03-04 00:32:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110527 to 89877. [2025-03-04 00:32:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89877 states, 80641 states have (on average 1.5430612219590532) internal successors, (124434), 80801 states have internal predecessors, (124434), 8388 states have call successors, (8388), 847 states have call predecessors, (8388), 847 states have return successors, (8388), 8228 states have call predecessors, (8388), 8388 states have call successors, (8388) [2025-03-04 00:32:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89877 states to 89877 states and 141210 transitions. [2025-03-04 00:32:06,037 INFO L78 Accepts]: Start accepts. Automaton has 89877 states and 141210 transitions. Word has length 481 [2025-03-04 00:32:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 89877 states and 141210 transitions. [2025-03-04 00:32:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:32:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89877 states and 141210 transitions. [2025-03-04 00:32:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-04 00:32:06,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:06,076 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:06,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:32:06,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:06,276 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:06,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1243888148, now seen corresponding path program 1 times [2025-03-04 00:32:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:06,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554482221] [2025-03-04 00:32:06,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:06,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:32:06,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:32:06,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:06,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat