./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.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 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:45:07,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:45:07,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:45:07,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:45:07,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:45:07,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:45:07,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:45:07,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:45:07,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:45:07,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:45:07,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:45:07,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:45:07,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:07,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:45:07,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:45:07,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:45:07,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:45:07,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:45:07,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:45:07,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:45:07,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:45:07,385 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 -> 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd [2025-03-08 15:45:07,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:45:07,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:45:07,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:45:07,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:45:07,626 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:45:07,627 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-53.i [2025-03-08 15:45:08,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa930482/23e2d1ffaccf46079f50a84fca4704c4/FLAG0eced0f3c [2025-03-08 15:45:09,070 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:45:09,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-03-08 15:45:09,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa930482/23e2d1ffaccf46079f50a84fca4704c4/FLAG0eced0f3c [2025-03-08 15:45:09,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa930482/23e2d1ffaccf46079f50a84fca4704c4 [2025-03-08 15:45:09,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:45:09,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:45:09,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:09,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:45:09,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:45:09,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:09,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09, skipping insertion in model container [2025-03-08 15:45:09,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:09,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:45:09,488 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-53.i[916,929] [2025-03-08 15:45:09,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:09,719 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:45:09,727 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-53.i[916,929] [2025-03-08 15:45:09,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:09,845 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:45:09,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09 WrapperNode [2025-03-08 15:45:09,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:09,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:09,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:45:09,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:45:09,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:09,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:09,937 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 609 [2025-03-08 15:45:09,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:09,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:45:09,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:45:09,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:45:09,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:09,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:09,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,028 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:45:10,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:45:10,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:45:10,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:45:10,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:45:10,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (1/1) ... [2025-03-08 15:45:10,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:10,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:45:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:45:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:45:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:45:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:45:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:45:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:45:10,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:45:10,228 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:45:10,229 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:45:11,098 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1; [2025-03-08 15:45:11,196 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-08 15:45:11,196 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:45:11,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:45:11,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:45:11,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:11 BoogieIcfgContainer [2025-03-08 15:45:11,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:45:11,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:45:11,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:45:11,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:45:11,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:45:09" (1/3) ... [2025-03-08 15:45:11,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1fa4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:11, skipping insertion in model container [2025-03-08 15:45:11,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:09" (2/3) ... [2025-03-08 15:45:11,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1fa4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:11, skipping insertion in model container [2025-03-08 15:45:11,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:11" (3/3) ... [2025-03-08 15:45:11,243 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-53.i [2025-03-08 15:45:11,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:45:11,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-53.i that has 2 procedures, 247 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:45:11,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:45:11,319 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;@5627b411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:45:11,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:45:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 15:45:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:11,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:11,341 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:11,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1833307070, now seen corresponding path program 1 times [2025-03-08 15:45:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201496775] [2025-03-08 15:45:11,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:11,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:11,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:11,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:11,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-08 15:45:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201496775] [2025-03-08 15:45:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201496775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735479584] [2025-03-08 15:45:11,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:11,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:45:12,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:12,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:12,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:12,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:12,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:45:12,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-08 15:45:12,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:45:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735479584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:12,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:45:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:45:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902762303] [2025-03-08 15:45:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:12,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:45:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:12,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:45:12,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:45:12,281 INFO L87 Difference]: Start difference. First operand has 247 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:12,316 INFO L93 Difference]: Finished difference Result 488 states and 888 transitions. [2025-03-08 15:45:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:45:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 456 [2025-03-08 15:45:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:12,323 INFO L225 Difference]: With dead ends: 488 [2025-03-08 15:45:12,323 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 15:45:12,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:45:12,329 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:12,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:45:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 15:45:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-08 15:45:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 175 states have (on average 1.5542857142857143) internal successors, (272), 175 states have internal predecessors, (272), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 15:45:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 406 transitions. [2025-03-08 15:45:12,381 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 406 transitions. Word has length 456 [2025-03-08 15:45:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:12,382 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 406 transitions. [2025-03-08 15:45:12,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 406 transitions. [2025-03-08 15:45:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:12,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:12,389 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:12,398 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-08 15:45:12,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:45:12,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:12,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1253324453, now seen corresponding path program 1 times [2025-03-08 15:45:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029509153] [2025-03-08 15:45:12,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:12,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:12,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:12,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:13,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029509153] [2025-03-08 15:45:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029509153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605131773] [2025-03-08 15:45:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:13,085 INFO L87 Difference]: Start difference. First operand 244 states and 406 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:13,241 INFO L93 Difference]: Finished difference Result 634 states and 1056 transitions. [2025-03-08 15:45:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:13,248 INFO L225 Difference]: With dead ends: 634 [2025-03-08 15:45:13,248 INFO L226 Difference]: Without dead ends: 393 [2025-03-08 15:45:13,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:13,250 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 227 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:13,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 780 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-08 15:45:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2025-03-08 15:45:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 294 states have (on average 1.5748299319727892) internal successors, (463), 295 states have internal predecessors, (463), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 15:45:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 649 transitions. [2025-03-08 15:45:13,298 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 649 transitions. Word has length 456 [2025-03-08 15:45:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:13,300 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 649 transitions. [2025-03-08 15:45:13,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 649 transitions. [2025-03-08 15:45:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:13,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:13,305 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:13,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:45:13,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash 418218781, now seen corresponding path program 1 times [2025-03-08 15:45:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043414619] [2025-03-08 15:45:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:13,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:13,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:13,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043414619] [2025-03-08 15:45:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043414619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:13,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:13,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:13,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76115937] [2025-03-08 15:45:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:13,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:13,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:13,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:13,676 INFO L87 Difference]: Start difference. First operand 390 states and 649 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:13,784 INFO L93 Difference]: Finished difference Result 1162 states and 1937 transitions. [2025-03-08 15:45:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:13,793 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 15:45:13,794 INFO L226 Difference]: Without dead ends: 775 [2025-03-08 15:45:13,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:13,797 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 387 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:13,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1148 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-08 15:45:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 771. [2025-03-08 15:45:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 580 states have (on average 1.5655172413793104) internal successors, (908), 582 states have internal predecessors, (908), 186 states have call successors, (186), 4 states have call predecessors, (186), 4 states have return successors, (186), 184 states have call predecessors, (186), 186 states have call successors, (186) [2025-03-08 15:45:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1280 transitions. [2025-03-08 15:45:13,872 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1280 transitions. Word has length 456 [2025-03-08 15:45:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1280 transitions. [2025-03-08 15:45:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1280 transitions. [2025-03-08 15:45:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:13,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:13,879 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:13,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:45:13,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:13,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2143699678, now seen corresponding path program 1 times [2025-03-08 15:45:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114323325] [2025-03-08 15:45:13,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:13,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:13,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114323325] [2025-03-08 15:45:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114323325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11129133] [2025-03-08 15:45:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:14,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:14,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:14,171 INFO L87 Difference]: Start difference. First operand 771 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:14,306 INFO L93 Difference]: Finished difference Result 2299 states and 3818 transitions. [2025-03-08 15:45:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:14,319 INFO L225 Difference]: With dead ends: 2299 [2025-03-08 15:45:14,319 INFO L226 Difference]: Without dead ends: 1531 [2025-03-08 15:45:14,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:14,324 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 379 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:14,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-03-08 15:45:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1529. [2025-03-08 15:45:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1148 states have (on average 1.5540069686411149) internal successors, (1784), 1152 states have internal predecessors, (1784), 372 states have call successors, (372), 8 states have call predecessors, (372), 8 states have return successors, (372), 368 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-08 15:45:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2528 transitions. [2025-03-08 15:45:14,462 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2528 transitions. Word has length 456 [2025-03-08 15:45:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:14,462 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2528 transitions. [2025-03-08 15:45:14,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2528 transitions. [2025-03-08 15:45:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:14,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:14,466 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:14,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:45:14,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1821501857, now seen corresponding path program 1 times [2025-03-08 15:45:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908106020] [2025-03-08 15:45:14,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:14,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:14,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908106020] [2025-03-08 15:45:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908106020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:14,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890934916] [2025-03-08 15:45:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:14,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:14,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:14,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:14,788 INFO L87 Difference]: Start difference. First operand 1529 states and 2528 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:14,945 INFO L93 Difference]: Finished difference Result 4257 states and 7018 transitions. [2025-03-08 15:45:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:14,965 INFO L225 Difference]: With dead ends: 4257 [2025-03-08 15:45:14,965 INFO L226 Difference]: Without dead ends: 2731 [2025-03-08 15:45:14,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:14,971 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 276 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:14,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 781 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2025-03-08 15:45:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2725. [2025-03-08 15:45:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 1972 states have (on average 1.5212981744421907) internal successors, (3000), 1984 states have internal predecessors, (3000), 736 states have call successors, (736), 16 states have call predecessors, (736), 16 states have return successors, (736), 724 states have call predecessors, (736), 736 states have call successors, (736) [2025-03-08 15:45:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4472 transitions. [2025-03-08 15:45:15,177 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4472 transitions. Word has length 456 [2025-03-08 15:45:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:15,178 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 4472 transitions. [2025-03-08 15:45:15,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4472 transitions. [2025-03-08 15:45:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:15,182 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:45:15,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1958782748, now seen corresponding path program 1 times [2025-03-08 15:45:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771431918] [2025-03-08 15:45:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:15,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:15,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:15,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771431918] [2025-03-08 15:45:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771431918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:16,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:16,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037128901] [2025-03-08 15:45:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:16,021 INFO L87 Difference]: Start difference. First operand 2725 states and 4472 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:16,302 INFO L93 Difference]: Finished difference Result 8169 states and 13410 transitions. [2025-03-08 15:45:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:16,333 INFO L225 Difference]: With dead ends: 8169 [2025-03-08 15:45:16,333 INFO L226 Difference]: Without dead ends: 5447 [2025-03-08 15:45:16,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:16,342 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 223 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:16,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 784 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2025-03-08 15:45:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 5429. [2025-03-08 15:45:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5429 states, 3924 states have (on average 1.5137614678899083) internal successors, (5940), 3948 states have internal predecessors, (5940), 1472 states have call successors, (1472), 32 states have call predecessors, (1472), 32 states have return successors, (1472), 1448 states have call predecessors, (1472), 1472 states have call successors, (1472) [2025-03-08 15:45:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 8884 transitions. [2025-03-08 15:45:16,717 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 8884 transitions. Word has length 456 [2025-03-08 15:45:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 5429 states and 8884 transitions. [2025-03-08 15:45:16,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 8884 transitions. [2025-03-08 15:45:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:16,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:16,723 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:16,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:45:16,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:16,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1762269243, now seen corresponding path program 1 times [2025-03-08 15:45:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:16,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803034430] [2025-03-08 15:45:16,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:16,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:16,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:17,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:17,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:17,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803034430] [2025-03-08 15:45:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803034430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:45:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473116060] [2025-03-08 15:45:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:45:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:18,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:45:18,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:18,278 INFO L87 Difference]: Start difference. First operand 5429 states and 8884 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:19,751 INFO L93 Difference]: Finished difference Result 15272 states and 24928 transitions. [2025-03-08 15:45:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:45:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 456 [2025-03-08 15:45:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:19,798 INFO L225 Difference]: With dead ends: 15272 [2025-03-08 15:45:19,798 INFO L226 Difference]: Without dead ends: 9846 [2025-03-08 15:45:19,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:45:19,813 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1033 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:19,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 2509 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:45:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2025-03-08 15:45:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 6586. [2025-03-08 15:45:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 5010 states have (on average 1.5538922155688624) internal successors, (7785), 5034 states have internal predecessors, (7785), 1539 states have call successors, (1539), 36 states have call predecessors, (1539), 36 states have return successors, (1539), 1515 states have call predecessors, (1539), 1539 states have call successors, (1539) [2025-03-08 15:45:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 10863 transitions. [2025-03-08 15:45:20,247 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 10863 transitions. Word has length 456 [2025-03-08 15:45:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:20,248 INFO L471 AbstractCegarLoop]: Abstraction has 6586 states and 10863 transitions. [2025-03-08 15:45:20,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 10863 transitions. [2025-03-08 15:45:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:20,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:20,254 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:45:20,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash 806747964, now seen corresponding path program 1 times [2025-03-08 15:45:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:20,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352160059] [2025-03-08 15:45:20,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:20,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:20,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:20,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352160059] [2025-03-08 15:45:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352160059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:21,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:21,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:45:21,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231643168] [2025-03-08 15:45:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:45:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:21,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:45:21,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:21,711 INFO L87 Difference]: Start difference. First operand 6586 states and 10863 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:23,357 INFO L93 Difference]: Finished difference Result 23943 states and 39507 transitions. [2025-03-08 15:45:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:45:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 456 [2025-03-08 15:45:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:23,428 INFO L225 Difference]: With dead ends: 23943 [2025-03-08 15:45:23,428 INFO L226 Difference]: Without dead ends: 18005 [2025-03-08 15:45:23,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:23,447 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1195 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:23,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1188 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:45:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2025-03-08 15:45:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 10927. [2025-03-08 15:45:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10927 states, 9127 states have (on average 1.5919798400350609) internal successors, (14530), 9183 states have internal predecessors, (14530), 1731 states have call successors, (1731), 68 states have call predecessors, (1731), 68 states have return successors, (1731), 1675 states have call predecessors, (1731), 1731 states have call successors, (1731) [2025-03-08 15:45:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10927 states to 10927 states and 17992 transitions. [2025-03-08 15:45:24,162 INFO L78 Accepts]: Start accepts. Automaton has 10927 states and 17992 transitions. Word has length 456 [2025-03-08 15:45:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:24,163 INFO L471 AbstractCegarLoop]: Abstraction has 10927 states and 17992 transitions. [2025-03-08 15:45:24,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10927 states and 17992 transitions. [2025-03-08 15:45:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:24,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:24,172 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:45:24,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:24,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -37723907, now seen corresponding path program 1 times [2025-03-08 15:45:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827824668] [2025-03-08 15:45:24,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:24,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:24,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:24,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:24,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:25,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827824668] [2025-03-08 15:45:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827824668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:25,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:25,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592843798] [2025-03-08 15:45:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:25,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:25,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:25,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:25,222 INFO L87 Difference]: Start difference. First operand 10927 states and 17992 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:25,858 INFO L93 Difference]: Finished difference Result 19945 states and 32705 transitions. [2025-03-08 15:45:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:45:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:25,897 INFO L225 Difference]: With dead ends: 19945 [2025-03-08 15:45:25,897 INFO L226 Difference]: Without dead ends: 10703 [2025-03-08 15:45:25,922 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-08 15:45:25,923 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 376 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:25,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 648 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2025-03-08 15:45:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 10703. [2025-03-08 15:45:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10703 states, 8903 states have (on average 1.5772211614062674) internal successors, (14042), 8959 states have internal predecessors, (14042), 1731 states have call successors, (1731), 68 states have call predecessors, (1731), 68 states have return successors, (1731), 1675 states have call predecessors, (1731), 1731 states have call successors, (1731) [2025-03-08 15:45:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 17504 transitions. [2025-03-08 15:45:26,520 INFO L78 Accepts]: Start accepts. Automaton has 10703 states and 17504 transitions. Word has length 456 [2025-03-08 15:45:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:26,521 INFO L471 AbstractCegarLoop]: Abstraction has 10703 states and 17504 transitions. [2025-03-08 15:45:26,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 10703 states and 17504 transitions. [2025-03-08 15:45:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:26,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:26,529 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:26,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:45:26,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1446539807, now seen corresponding path program 1 times [2025-03-08 15:45:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106130072] [2025-03-08 15:45:26,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:26,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:26,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:26,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:26,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106130072] [2025-03-08 15:45:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106130072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463826464] [2025-03-08 15:45:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:27,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:27,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:27,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:27,316 INFO L87 Difference]: Start difference. First operand 10703 states and 17504 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:27,646 INFO L93 Difference]: Finished difference Result 22179 states and 36314 transitions. [2025-03-08 15:45:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:45:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 456 [2025-03-08 15:45:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:27,686 INFO L225 Difference]: With dead ends: 22179 [2025-03-08 15:45:27,686 INFO L226 Difference]: Without dead ends: 12233 [2025-03-08 15:45:27,708 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-08 15:45:27,709 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 338 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:27,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1719 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2025-03-08 15:45:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 8215. [2025-03-08 15:45:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8215 states, 7263 states have (on average 1.6018174308137134) internal successors, (11634), 7287 states have internal predecessors, (11634), 907 states have call successors, (907), 44 states have call predecessors, (907), 44 states have return successors, (907), 883 states have call predecessors, (907), 907 states have call successors, (907) [2025-03-08 15:45:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 13448 transitions. [2025-03-08 15:45:28,200 INFO L78 Accepts]: Start accepts. Automaton has 8215 states and 13448 transitions. Word has length 456 [2025-03-08 15:45:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:28,200 INFO L471 AbstractCegarLoop]: Abstraction has 8215 states and 13448 transitions. [2025-03-08 15:45:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 8215 states and 13448 transitions. [2025-03-08 15:45:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 15:45:28,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:28,209 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:28,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:45:28,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:28,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1191803262, now seen corresponding path program 1 times [2025-03-08 15:45:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:28,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539344201] [2025-03-08 15:45:28,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:28,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:31,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:31,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:31,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 6 proven. 192 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:45:32,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:32,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539344201] [2025-03-08 15:45:32,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539344201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:32,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591630838] [2025-03-08 15:45:32,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:32,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:32,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:32,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:45:32,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 15:45:32,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 15:45:32,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:32,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:32,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:45:32,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4416 proven. 111 refuted. 0 times theorem prover too weak. 4317 trivial. 0 not checked. [2025-03-08 15:45:32,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 87 proven. 111 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:45:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591630838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:33,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:33,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:45:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249178879] [2025-03-08 15:45:33,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:45:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:33,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:45:33,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:45:33,374 INFO L87 Difference]: Start difference. First operand 8215 states and 13448 transitions. Second operand has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-03-08 15:45:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:34,052 INFO L93 Difference]: Finished difference Result 12973 states and 21131 transitions. [2025-03-08 15:45:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:45:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) Word has length 456 [2025-03-08 15:45:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:34,071 INFO L225 Difference]: With dead ends: 12973 [2025-03-08 15:45:34,071 INFO L226 Difference]: Without dead ends: 4905 [2025-03-08 15:45:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 909 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:45:34,079 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 437 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 699 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:45:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2025-03-08 15:45:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4000. [2025-03-08 15:45:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4000 states, 3137 states have (on average 1.4947401976410584) internal successors, (4689), 3146 states have internal predecessors, (4689), 809 states have call successors, (809), 53 states have call predecessors, (809), 53 states have return successors, (809), 800 states have call predecessors, (809), 809 states have call successors, (809) [2025-03-08 15:45:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 6307 transitions. [2025-03-08 15:45:34,348 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 6307 transitions. Word has length 456 [2025-03-08 15:45:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:34,349 INFO L471 AbstractCegarLoop]: Abstraction has 4000 states and 6307 transitions. [2025-03-08 15:45:34,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-03-08 15:45:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 6307 transitions. [2025-03-08 15:45:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 15:45:34,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:34,352 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:34,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:45:34,557 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,SelfDestructingSolverStorable10 [2025-03-08 15:45:34,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 797935774, now seen corresponding path program 1 times [2025-03-08 15:45:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:34,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349745938] [2025-03-08 15:45:34,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:34,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:45:34,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:45:34,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:34,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349745938] [2025-03-08 15:45:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349745938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:45:36,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285496300] [2025-03-08 15:45:36,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:36,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:45:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:36,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:45:36,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:45:36,130 INFO L87 Difference]: Start difference. First operand 4000 states and 6307 transitions. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-08 15:45:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:37,804 INFO L93 Difference]: Finished difference Result 11081 states and 17464 transitions. [2025-03-08 15:45:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:45:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) Word has length 458 [2025-03-08 15:45:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:37,827 INFO L225 Difference]: With dead ends: 11081 [2025-03-08 15:45:37,827 INFO L226 Difference]: Without dead ends: 7207 [2025-03-08 15:45:37,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:45:37,836 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 2078 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:37,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1970 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:45:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2025-03-08 15:45:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 4881. [2025-03-08 15:45:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4015 states have (on average 1.5235367372353674) internal successors, (6117), 4023 states have internal predecessors, (6117), 811 states have call successors, (811), 54 states have call predecessors, (811), 54 states have return successors, (811), 803 states have call predecessors, (811), 811 states have call successors, (811) [2025-03-08 15:45:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 7739 transitions. [2025-03-08 15:45:38,120 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 7739 transitions. Word has length 458 [2025-03-08 15:45:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:38,120 INFO L471 AbstractCegarLoop]: Abstraction has 4881 states and 7739 transitions. [2025-03-08 15:45:38,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-08 15:45:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 7739 transitions. [2025-03-08 15:45:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 15:45:38,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:38,125 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:38,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:45:38,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:38,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:38,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1664987999, now seen corresponding path program 1 times [2025-03-08 15:45:38,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:38,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744309376] [2025-03-08 15:45:38,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:38,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:45:38,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:45:38,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:38,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744309376] [2025-03-08 15:45:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744309376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:39,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:45:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117889631] [2025-03-08 15:45:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:45:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:39,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:45:39,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:39,189 INFO L87 Difference]: Start difference. First operand 4881 states and 7739 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:39,995 INFO L93 Difference]: Finished difference Result 12895 states and 20397 transitions. [2025-03-08 15:45:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 458 [2025-03-08 15:45:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:40,018 INFO L225 Difference]: With dead ends: 12895 [2025-03-08 15:45:40,019 INFO L226 Difference]: Without dead ends: 8669 [2025-03-08 15:45:40,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:40,026 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 428 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:40,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 908 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:45:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2025-03-08 15:45:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 7979. [2025-03-08 15:45:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7979 states, 6985 states have (on average 1.541159627773801) internal successors, (10765), 7009 states have internal predecessors, (10765), 907 states have call successors, (907), 86 states have call predecessors, (907), 86 states have return successors, (907), 883 states have call predecessors, (907), 907 states have call successors, (907) [2025-03-08 15:45:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 12579 transitions. [2025-03-08 15:45:40,329 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 12579 transitions. Word has length 458 [2025-03-08 15:45:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:40,330 INFO L471 AbstractCegarLoop]: Abstraction has 7979 states and 12579 transitions. [2025-03-08 15:45:40,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-08 15:45:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 12579 transitions. [2025-03-08 15:45:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 15:45:40,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:40,337 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:40,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:45:40,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 820516128, now seen corresponding path program 1 times [2025-03-08 15:45:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:40,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050257111] [2025-03-08 15:45:40,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:40,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:45:42,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:45:42,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:42,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 18 proven. 180 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:45:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050257111] [2025-03-08 15:45:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050257111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852981323] [2025-03-08 15:45:42,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:42,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:42,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:42,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:42,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:45:42,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:45:42,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:45:42,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:42,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:45:42,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4482 proven. 102 refuted. 0 times theorem prover too weak. 4260 trivial. 0 not checked. [2025-03-08 15:45:43,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 96 proven. 102 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:45:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852981323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:43,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-08 15:45:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115525199] [2025-03-08 15:45:43,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:43,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:45:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:43,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:45:43,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:45:43,516 INFO L87 Difference]: Start difference. First operand 7979 states and 12579 transitions. Second operand has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-03-08 15:45:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:44,555 INFO L93 Difference]: Finished difference Result 16739 states and 26266 transitions. [2025-03-08 15:45:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 15:45:44,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) Word has length 458 [2025-03-08 15:45:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:44,580 INFO L225 Difference]: With dead ends: 16739 [2025-03-08 15:45:44,580 INFO L226 Difference]: Without dead ends: 8896 [2025-03-08 15:45:44,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:45:44,591 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1117 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:44,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1368 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:45:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8896 states. [2025-03-08 15:45:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8896 to 8780. [2025-03-08 15:45:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8780 states, 7367 states have (on average 1.5158137640830731) internal successors, (11167), 7391 states have internal predecessors, (11167), 1275 states have call successors, (1275), 137 states have call predecessors, (1275), 137 states have return successors, (1275), 1251 states have call predecessors, (1275), 1275 states have call successors, (1275) [2025-03-08 15:45:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 13717 transitions. [2025-03-08 15:45:45,040 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 13717 transitions. Word has length 458 [2025-03-08 15:45:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 8780 states and 13717 transitions. [2025-03-08 15:45:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-03-08 15:45:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 13717 transitions. [2025-03-08 15:45:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:45:45,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:45,047 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:45,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:45:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:45,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:45,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash -832157109, now seen corresponding path program 1 times [2025-03-08 15:45:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672051996] [2025-03-08 15:45:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:45,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:45:47,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:45:47,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:47,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:45:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672051996] [2025-03-08 15:45:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672051996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:45:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862260309] [2025-03-08 15:45:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:45:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:45:53,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:45:53,291 INFO L87 Difference]: Start difference. First operand 8780 states and 13717 transitions. Second operand has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:57,119 INFO L93 Difference]: Finished difference Result 50549 states and 79974 transitions. [2025-03-08 15:45:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:45:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 459 [2025-03-08 15:45:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:57,189 INFO L225 Difference]: With dead ends: 50549 [2025-03-08 15:45:57,189 INFO L226 Difference]: Without dead ends: 43187 [2025-03-08 15:45:57,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:45:57,207 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 2634 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2634 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:57,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2634 Valid, 2981 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 15:45:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43187 states. [2025-03-08 15:45:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43187 to 13088. [2025-03-08 15:45:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13088 states, 11675 states have (on average 1.5498929336188436) internal successors, (18095), 11699 states have internal predecessors, (18095), 1275 states have call successors, (1275), 137 states have call predecessors, (1275), 137 states have return successors, (1275), 1251 states have call predecessors, (1275), 1275 states have call successors, (1275) [2025-03-08 15:45:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13088 states to 13088 states and 20645 transitions. [2025-03-08 15:45:57,830 INFO L78 Accepts]: Start accepts. Automaton has 13088 states and 20645 transitions. Word has length 459 [2025-03-08 15:45:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:57,831 INFO L471 AbstractCegarLoop]: Abstraction has 13088 states and 20645 transitions. [2025-03-08 15:45:57,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-08 15:45:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13088 states and 20645 transitions. [2025-03-08 15:45:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:45:57,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:57,841 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:57,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:45:57,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:57,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1794941547, now seen corresponding path program 1 times [2025-03-08 15:45:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:57,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400695646] [2025-03-08 15:45:57,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:57,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:45:59,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:45:59,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:59,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 195 proven. 3 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:45:59,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400695646] [2025-03-08 15:45:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400695646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637116120] [2025-03-08 15:45:59,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:59,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:59,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:59,395 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-08 15:45:59,396 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-08 15:45:59,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:45:59,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:45:59,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:59,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:59,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:45:59,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 456 proven. 3 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 15:45:59,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 195 proven. 3 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:45:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637116120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:59,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:45:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025416083] [2025-03-08 15:45:59,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:59,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:45:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:59,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:45:59,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:45:59,919 INFO L87 Difference]: Start difference. First operand 13088 states and 20645 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), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 15:46:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:00,552 INFO L93 Difference]: Finished difference Result 20848 states and 32587 transitions. [2025-03-08 15:46:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:46:00,552 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), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 459 [2025-03-08 15:46:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:00,583 INFO L225 Difference]: With dead ends: 20848 [2025-03-08 15:46:00,583 INFO L226 Difference]: Without dead ends: 9420 [2025-03-08 15:46:00,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:46:00,597 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 484 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:00,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 775 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:46:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2025-03-08 15:46:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 9314. [2025-03-08 15:46:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9314 states, 7892 states have (on average 1.5093765838824125) internal successors, (11912), 7916 states have internal predecessors, (11912), 1275 states have call successors, (1275), 146 states have call predecessors, (1275), 146 states have return successors, (1275), 1251 states have call predecessors, (1275), 1275 states have call successors, (1275) [2025-03-08 15:46:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 14462 transitions. [2025-03-08 15:46:01,046 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 14462 transitions. Word has length 459 [2025-03-08 15:46:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:01,046 INFO L471 AbstractCegarLoop]: Abstraction has 9314 states and 14462 transitions. [2025-03-08 15:46:01,047 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), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 15:46:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 14462 transitions. [2025-03-08 15:46:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:01,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:01,053 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:01,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:46:01,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:46:01,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:01,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash 279536655, now seen corresponding path program 1 times [2025-03-08 15:46:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728702702] [2025-03-08 15:46:01,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:01,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:02,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:02,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:02,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-08 15:46:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728702702] [2025-03-08 15:46:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728702702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493084994] [2025-03-08 15:46:03,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:03,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:03,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:03,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:46:04,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:04,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:04,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:04,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:04,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 15:46:04,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 1118 proven. 378 refuted. 0 times theorem prover too weak. 7348 trivial. 0 not checked. [2025-03-08 15:46:05,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 12 proven. 381 refuted. 0 times theorem prover too weak. 8451 trivial. 0 not checked. [2025-03-08 15:46:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493084994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:06,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:06,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2025-03-08 15:46:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232114422] [2025-03-08 15:46:06,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:06,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:46:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:06,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:46:06,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:46:06,527 INFO L87 Difference]: Start difference. First operand 9314 states and 14462 transitions. Second operand has 20 states, 20 states have (on average 17.5) internal successors, (350), 20 states have internal predecessors, (350), 5 states have call successors, (199), 3 states have call predecessors, (199), 7 states have return successors, (200), 4 states have call predecessors, (200), 5 states have call successors, (200) [2025-03-08 15:46:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:10,133 INFO L93 Difference]: Finished difference Result 34190 states and 50892 transitions. [2025-03-08 15:46:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-08 15:46:10,133 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 17.5) internal successors, (350), 20 states have internal predecessors, (350), 5 states have call successors, (199), 3 states have call predecessors, (199), 7 states have return successors, (200), 4 states have call predecessors, (200), 5 states have call successors, (200) Word has length 460 [2025-03-08 15:46:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:10,198 INFO L225 Difference]: With dead ends: 34190 [2025-03-08 15:46:10,198 INFO L226 Difference]: Without dead ends: 26124 [2025-03-08 15:46:10,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 917 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1141, Invalid=3971, Unknown=0, NotChecked=0, Total=5112 [2025-03-08 15:46:10,220 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1666 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:10,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 2220 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:46:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26124 states. [2025-03-08 15:46:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26124 to 14089. [2025-03-08 15:46:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14089 states, 12056 states have (on average 1.4607664233576643) internal successors, (17611), 12144 states have internal predecessors, (17611), 1595 states have call successors, (1595), 437 states have call predecessors, (1595), 437 states have return successors, (1595), 1507 states have call predecessors, (1595), 1595 states have call successors, (1595) [2025-03-08 15:46:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 20801 transitions. [2025-03-08 15:46:11,293 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 20801 transitions. Word has length 460 [2025-03-08 15:46:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:11,294 INFO L471 AbstractCegarLoop]: Abstraction has 14089 states and 20801 transitions. [2025-03-08 15:46:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.5) internal successors, (350), 20 states have internal predecessors, (350), 5 states have call successors, (199), 3 states have call predecessors, (199), 7 states have return successors, (200), 4 states have call predecessors, (200), 5 states have call successors, (200) [2025-03-08 15:46:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 20801 transitions. [2025-03-08 15:46:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:11,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:11,305 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:11,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:46:11,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 15:46:11,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 950332942, now seen corresponding path program 1 times [2025-03-08 15:46:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268665433] [2025-03-08 15:46:11,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:11,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:12,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:12,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:12,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-08 15:46:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268665433] [2025-03-08 15:46:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268665433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:15,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:46:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910439209] [2025-03-08 15:46:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:15,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:46:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:15,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:46:15,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:46:15,064 INFO L87 Difference]: Start difference. First operand 14089 states and 20801 transitions. Second operand has 12 states, 12 states have (on average 10.666666666666666) internal successors, (128), 12 states have internal predecessors, (128), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67)