./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-85.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 f3b875613fa5f97f08f3833527f8e0ee0d41bb6c604e635f1323b904ed09bfde --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:54:49,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:54:49,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:54:49,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:54:49,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:54:49,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:54:49,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:54:49,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:54:49,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:54:49,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:54:49,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:54:49,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:54:49,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:54:49,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:54:49,491 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:54:49,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:54:49,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:54:49,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:54:49,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:54:49,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:54:49,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:54:49,494 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 -> f3b875613fa5f97f08f3833527f8e0ee0d41bb6c604e635f1323b904ed09bfde [2025-03-17 04:54:49,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:54:49,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:54:49,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:54:49,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:54:49,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:54:49,721 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-85.i [2025-03-17 04:54:50,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10fed136/f05c42ba99e4450099832c78c4df5db9/FLAGf870d955b [2025-03-17 04:54:51,174 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:54:51,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-85.i [2025-03-17 04:54:51,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10fed136/f05c42ba99e4450099832c78c4df5db9/FLAGf870d955b [2025-03-17 04:54:51,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10fed136/f05c42ba99e4450099832c78c4df5db9 [2025-03-17 04:54:51,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:54:51,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:54:51,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:54:51,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:54:51,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:54:51,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:51,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b22eac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51, skipping insertion in model container [2025-03-17 04:54:51,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:51,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:54:51,599 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-85.i[916,929] [2025-03-17 04:54:51,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:54:51,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:54:51,822 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-85.i[916,929] [2025-03-17 04:54:51,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:54:51,944 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:54:51,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51 WrapperNode [2025-03-17 04:54:51,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:54:51,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:54:51,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:54:51,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:54:51,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:51,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,030 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 687 [2025-03-17 04:54:52,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:54:52,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:54:52,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:54:52,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:54:52,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,136 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-17 04:54:52,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:54:52,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:54:52,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:54:52,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:54:52,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (1/1) ... [2025-03-17 04:54:52,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:54:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:54:52,219 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-17 04:54:52,221 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-17 04:54:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:54:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:54:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:54:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:54:52,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:54:52,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:54:52,353 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:54:52,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:54:53,167 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: havoc property_#t~bitwise45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~ite51#1;havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1; [2025-03-17 04:54:53,277 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-17 04:54:53,277 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:54:53,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:54:53,302 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:54:53,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:54:53 BoogieIcfgContainer [2025-03-17 04:54:53,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:54:53,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:54:53,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:54:53,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:54:53,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:54:51" (1/3) ... [2025-03-17 04:54:53,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c0b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:54:53, skipping insertion in model container [2025-03-17 04:54:53,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:51" (2/3) ... [2025-03-17 04:54:53,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c0b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:54:53, skipping insertion in model container [2025-03-17 04:54:53,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:54:53" (3/3) ... [2025-03-17 04:54:53,312 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-85.i [2025-03-17 04:54:53,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:54:53,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-85.i that has 2 procedures, 265 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:54:53,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:54:53,392 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;@5e0931f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:54:53,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:54:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 197 states have (on average 1.5583756345177664) internal successors, (307), 198 states have internal predecessors, (307), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 04:54:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 04:54:53,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:53,419 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:53,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1127715037, now seen corresponding path program 1 times [2025-03-17 04:54:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:53,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683997565] [2025-03-17 04:54:53,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:53,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:53,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-17 04:54:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683997565] [2025-03-17 04:54:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683997565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:54:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998888315] [2025-03-17 04:54:54,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:54,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:54:54,078 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-17 04:54:54,080 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-17 04:54:54,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:54,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:54,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:54,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:54,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:54:54,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:54:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-17 04:54:54,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:54:54,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998888315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:54,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:54:54,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:54:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981159902] [2025-03-17 04:54:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:54,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:54:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:54:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:54:54,550 INFO L87 Difference]: Start difference. First operand has 265 states, 197 states have (on average 1.5583756345177664) internal successors, (307), 198 states have internal predecessors, (307), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-17 04:54:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:54,617 INFO L93 Difference]: Finished difference Result 527 states and 937 transitions. [2025-03-17 04:54:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:54:54,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 452 [2025-03-17 04:54:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:54,627 INFO L225 Difference]: With dead ends: 527 [2025-03-17 04:54:54,627 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 04:54:54,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 453 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-17 04:54:54,638 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:54,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:54:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 04:54:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-17 04:54:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 196 states have (on average 1.5357142857142858) internal successors, (301), 196 states have internal predecessors, (301), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 04:54:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 431 transitions. [2025-03-17 04:54:54,716 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 431 transitions. Word has length 452 [2025-03-17 04:54:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:54,717 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 431 transitions. [2025-03-17 04:54:54,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-17 04:54:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 431 transitions. [2025-03-17 04:54:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 04:54:54,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:54,726 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:54,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:54:54,930 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-17 04:54:54,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1758691172, now seen corresponding path program 1 times [2025-03-17 04:54:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499968020] [2025-03-17 04:54:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:54,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:55,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:55,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:55,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499968020] [2025-03-17 04:54:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499968020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:54:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458431498] [2025-03-17 04:54:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:55,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:54:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:55,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:54:55,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:54:55,512 INFO L87 Difference]: Start difference. First operand 263 states and 431 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:55,669 INFO L93 Difference]: Finished difference Result 777 states and 1275 transitions. [2025-03-17 04:54:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:54:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 452 [2025-03-17 04:54:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:55,677 INFO L225 Difference]: With dead ends: 777 [2025-03-17 04:54:55,677 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 04:54:55,678 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-17 04:54:55,680 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 409 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:55,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 815 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:54:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 04:54:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 283. [2025-03-17 04:54:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 04:54:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 466 transitions. [2025-03-17 04:54:55,722 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 466 transitions. Word has length 452 [2025-03-17 04:54:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:55,724 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 466 transitions. [2025-03-17 04:54:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 466 transitions. [2025-03-17 04:54:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 04:54:55,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:55,732 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:55,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:54:55,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:55,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1905817499, now seen corresponding path program 1 times [2025-03-17 04:54:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942971520] [2025-03-17 04:54:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:55,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:55,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:55,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942971520] [2025-03-17 04:54:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942971520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:54:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834346515] [2025-03-17 04:54:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:56,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:54:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:56,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:54:56,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:54:56,187 INFO L87 Difference]: Start difference. First operand 283 states and 466 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:56,370 INFO L93 Difference]: Finished difference Result 840 states and 1382 transitions. [2025-03-17 04:54:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:54:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 452 [2025-03-17 04:54:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:56,376 INFO L225 Difference]: With dead ends: 840 [2025-03-17 04:54:56,376 INFO L226 Difference]: Without dead ends: 558 [2025-03-17 04:54:56,377 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-17 04:54:56,380 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 410 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:56,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 825 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:54:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-17 04:54:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 556. [2025-03-17 04:54:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 423 states have (on average 1.5271867612293144) internal successors, (646), 423 states have internal predecessors, (646), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 04:54:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 906 transitions. [2025-03-17 04:54:56,435 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 906 transitions. Word has length 452 [2025-03-17 04:54:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 906 transitions. [2025-03-17 04:54:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 906 transitions. [2025-03-17 04:54:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 04:54:56,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:56,444 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:54:56,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:56,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:56,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1212424794, now seen corresponding path program 1 times [2025-03-17 04:54:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937151465] [2025-03-17 04:54:56,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:56,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:56,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:56,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:56,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:56,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937151465] [2025-03-17 04:54:56,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937151465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:56,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:56,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:54:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258704976] [2025-03-17 04:54:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:56,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:54:56,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:56,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:54:56,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:54:56,803 INFO L87 Difference]: Start difference. First operand 556 states and 906 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:57,200 INFO L93 Difference]: Finished difference Result 1582 states and 2574 transitions. [2025-03-17 04:54:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:54:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 452 [2025-03-17 04:54:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:57,206 INFO L225 Difference]: With dead ends: 1582 [2025-03-17 04:54:57,207 INFO L226 Difference]: Without dead ends: 1027 [2025-03-17 04:54:57,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:54:57,209 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 882 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:57,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1326 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:54:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-17 04:54:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 613. [2025-03-17 04:54:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 480 states have (on average 1.5395833333333333) internal successors, (739), 480 states have internal predecessors, (739), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 04:54:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 999 transitions. [2025-03-17 04:54:57,260 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 999 transitions. Word has length 452 [2025-03-17 04:54:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:57,260 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 999 transitions. [2025-03-17 04:54:57,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 999 transitions. [2025-03-17 04:54:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 04:54:57,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:57,269 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:57,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:54:57,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:57,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2123233308, now seen corresponding path program 1 times [2025-03-17 04:54:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:57,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838308106] [2025-03-17 04:54:57,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:57,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:57,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:57,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:57,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:57,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:57,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838308106] [2025-03-17 04:54:57,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838308106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:57,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:57,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:54:57,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98265030] [2025-03-17 04:54:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:57,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:54:57,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:57,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:54:57,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:54:57,550 INFO L87 Difference]: Start difference. First operand 613 states and 999 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:57,678 INFO L93 Difference]: Finished difference Result 1627 states and 2643 transitions. [2025-03-17 04:54:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:54:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 452 [2025-03-17 04:54:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:57,684 INFO L225 Difference]: With dead ends: 1627 [2025-03-17 04:54:57,684 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 04:54:57,686 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-17 04:54:57,686 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 398 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:57,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1160 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:54:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 04:54:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 603. [2025-03-17 04:54:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 470 states have internal predecessors, (715), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 04:54:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 975 transitions. [2025-03-17 04:54:57,745 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 975 transitions. Word has length 452 [2025-03-17 04:54:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:57,747 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 975 transitions. [2025-03-17 04:54:57,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 975 transitions. [2025-03-17 04:54:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 04:54:57,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:57,755 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:57,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:54:57,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2130992667, now seen corresponding path program 1 times [2025-03-17 04:54:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367623640] [2025-03-17 04:54:57,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:57,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 04:54:57,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 04:54:57,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:57,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367623640] [2025-03-17 04:54:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367623640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:58,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:58,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:54:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161245940] [2025-03-17 04:54:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:58,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:54:58,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:58,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:54:58,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:54:58,016 INFO L87 Difference]: Start difference. First operand 603 states and 975 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:58,152 INFO L93 Difference]: Finished difference Result 1209 states and 1954 transitions. [2025-03-17 04:54:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:54:58,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 452 [2025-03-17 04:54:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:58,157 INFO L225 Difference]: With dead ends: 1209 [2025-03-17 04:54:58,157 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 04:54:58,159 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-17 04:54:58,161 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 405 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:58,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1118 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:54:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 04:54:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 558. [2025-03-17 04:54:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 425 states have (on average 1.4870588235294118) internal successors, (632), 425 states have internal predecessors, (632), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 04:54:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 892 transitions. [2025-03-17 04:54:58,198 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 892 transitions. Word has length 452 [2025-03-17 04:54:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 892 transitions. [2025-03-17 04:54:58,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 892 transitions. [2025-03-17 04:54:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:54:58,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:58,203 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:58,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:54:58,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2121197999, now seen corresponding path program 1 times [2025-03-17 04:54:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29928301] [2025-03-17 04:54:58,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:58,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:54:58,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:54:58,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:58,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29928301] [2025-03-17 04:54:58,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29928301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:58,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:58,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:54:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239200943] [2025-03-17 04:54:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:58,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:54:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:58,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:54:58,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:54:58,403 INFO L87 Difference]: Start difference. First operand 558 states and 892 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:58,519 INFO L93 Difference]: Finished difference Result 1652 states and 2642 transitions. [2025-03-17 04:54:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:54:58,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 453 [2025-03-17 04:54:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:58,526 INFO L225 Difference]: With dead ends: 1652 [2025-03-17 04:54:58,526 INFO L226 Difference]: Without dead ends: 1095 [2025-03-17 04:54:58,527 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-17 04:54:58,528 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 407 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:58,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1210 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:54:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-03-17 04:54:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 584. [2025-03-17 04:54:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 451 states have (on average 1.4900221729490022) internal successors, (672), 451 states have internal predecessors, (672), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 04:54:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 932 transitions. [2025-03-17 04:54:58,576 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 932 transitions. Word has length 453 [2025-03-17 04:54:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:58,576 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 932 transitions. [2025-03-17 04:54:58,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 932 transitions. [2025-03-17 04:54:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:54:58,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:58,579 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:58,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:54:58,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:58,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1997124752, now seen corresponding path program 1 times [2025-03-17 04:54:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71651871] [2025-03-17 04:54:58,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:58,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:54:58,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:54:58,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:58,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:54:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71651871] [2025-03-17 04:54:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71651871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:59,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:54:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262992579] [2025-03-17 04:54:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:59,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:54:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:59,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:54:59,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:54:59,167 INFO L87 Difference]: Start difference. First operand 584 states and 932 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:59,496 INFO L93 Difference]: Finished difference Result 1588 states and 2530 transitions. [2025-03-17 04:54:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:54:59,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 453 [2025-03-17 04:54:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:59,502 INFO L225 Difference]: With dead ends: 1588 [2025-03-17 04:54:59,502 INFO L226 Difference]: Without dead ends: 1005 [2025-03-17 04:54:59,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:54:59,505 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 443 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:59,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1229 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:54:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-17 04:54:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 985. [2025-03-17 04:54:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 786 states have (on average 1.5025445292620865) internal successors, (1181), 786 states have internal predecessors, (1181), 195 states have call successors, (195), 3 states have call predecessors, (195), 3 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-17 04:54:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1571 transitions. [2025-03-17 04:54:59,593 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1571 transitions. Word has length 453 [2025-03-17 04:54:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:59,593 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1571 transitions. [2025-03-17 04:54:59,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:54:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1571 transitions. [2025-03-17 04:54:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 04:54:59,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:59,596 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:54:59,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:54:59,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1039936743, now seen corresponding path program 1 times [2025-03-17 04:54:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693491475] [2025-03-17 04:54:59,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:59,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 04:54:59,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 04:54:59,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:55:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:00,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693491475] [2025-03-17 04:55:00,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693491475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:55:00,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:55:00,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:55:00,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325029300] [2025-03-17 04:55:00,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:55:00,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:55:00,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:00,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:55:00,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:55:00,167 INFO L87 Difference]: Start difference. First operand 985 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:00,570 INFO L93 Difference]: Finished difference Result 3415 states and 5432 transitions. [2025-03-17 04:55:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:55:00,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 454 [2025-03-17 04:55:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:00,581 INFO L225 Difference]: With dead ends: 3415 [2025-03-17 04:55:00,581 INFO L226 Difference]: Without dead ends: 2564 [2025-03-17 04:55:00,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:55:00,584 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 1019 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:00,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1204 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:55:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-17 04:55:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2526. [2025-03-17 04:55:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2195 states have (on average 1.537129840546697) internal successors, (3374), 2195 states have internal predecessors, (3374), 325 states have call successors, (325), 5 states have call predecessors, (325), 5 states have return successors, (325), 325 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-17 04:55:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 4024 transitions. [2025-03-17 04:55:00,712 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 4024 transitions. Word has length 454 [2025-03-17 04:55:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:00,713 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 4024 transitions. [2025-03-17 04:55:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 4024 transitions. [2025-03-17 04:55:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 04:55:00,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:00,717 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:00,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:55:00,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:00,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -169257197, now seen corresponding path program 1 times [2025-03-17 04:55:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820716227] [2025-03-17 04:55:00,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:00,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:00,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 04:55:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 04:55:00,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:00,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:55:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820716227] [2025-03-17 04:55:01,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820716227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:55:01,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:55:01,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:55:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360887052] [2025-03-17 04:55:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:55:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:55:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:55:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:55:01,294 INFO L87 Difference]: Start difference. First operand 2526 states and 4024 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:02,016 INFO L93 Difference]: Finished difference Result 6352 states and 10171 transitions. [2025-03-17 04:55:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:55:02,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-03-17 04:55:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:02,037 INFO L225 Difference]: With dead ends: 6352 [2025-03-17 04:55:02,037 INFO L226 Difference]: Without dead ends: 4332 [2025-03-17 04:55:02,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:55:02,043 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 942 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:02,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1443 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:55:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2025-03-17 04:55:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 2526. [2025-03-17 04:55:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2195 states have (on average 1.5343963553530753) internal successors, (3368), 2195 states have internal predecessors, (3368), 325 states have call successors, (325), 5 states have call predecessors, (325), 5 states have return successors, (325), 325 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-17 04:55:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 4018 transitions. [2025-03-17 04:55:02,226 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 4018 transitions. Word has length 455 [2025-03-17 04:55:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:02,227 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 4018 transitions. [2025-03-17 04:55:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 4018 transitions. [2025-03-17 04:55:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 04:55:02,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:02,231 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:02,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:55:02,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:02,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1014090100, now seen corresponding path program 1 times [2025-03-17 04:55:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677878063] [2025-03-17 04:55:02,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:02,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 04:55:02,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 04:55:02,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:02,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:55:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677878063] [2025-03-17 04:55:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677878063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:55:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:55:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:55:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993021199] [2025-03-17 04:55:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:55:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:55:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:03,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:55:03,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:55:03,428 INFO L87 Difference]: Start difference. First operand 2526 states and 4018 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:03,868 INFO L93 Difference]: Finished difference Result 4938 states and 7838 transitions. [2025-03-17 04:55:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:55:03,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-03-17 04:55:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:03,878 INFO L225 Difference]: With dead ends: 4938 [2025-03-17 04:55:03,879 INFO L226 Difference]: Without dead ends: 2564 [2025-03-17 04:55:03,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:55:03,882 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 561 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:03,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1204 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:55:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-17 04:55:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2534. [2025-03-17 04:55:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2203 states have (on average 1.5315478892419427) internal successors, (3374), 2203 states have internal predecessors, (3374), 325 states have call successors, (325), 5 states have call predecessors, (325), 5 states have return successors, (325), 325 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-17 04:55:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 4024 transitions. [2025-03-17 04:55:03,984 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 4024 transitions. Word has length 455 [2025-03-17 04:55:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:03,985 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 4024 transitions. [2025-03-17 04:55:03,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 4024 transitions. [2025-03-17 04:55:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 04:55:03,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:03,988 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:03,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:55:03,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1042687143, now seen corresponding path program 1 times [2025-03-17 04:55:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664186211] [2025-03-17 04:55:03,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:04,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 04:55:04,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 04:55:04,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:04,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:55:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664186211] [2025-03-17 04:55:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664186211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:55:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:55:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:55:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792663474] [2025-03-17 04:55:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:55:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:55:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:55:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:55:05,513 INFO L87 Difference]: Start difference. First operand 2534 states and 4024 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:06,477 INFO L93 Difference]: Finished difference Result 9360 states and 14849 transitions. [2025-03-17 04:55:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:55:06,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-17 04:55:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:06,513 INFO L225 Difference]: With dead ends: 9360 [2025-03-17 04:55:06,513 INFO L226 Difference]: Without dead ends: 7320 [2025-03-17 04:55:06,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:55:06,522 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 792 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:06,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1960 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:55:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2025-03-17 04:55:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 5208. [2025-03-17 04:55:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 4724 states have (on average 1.5455122777307366) internal successors, (7301), 4728 states have internal predecessors, (7301), 473 states have call successors, (473), 10 states have call predecessors, (473), 10 states have return successors, (473), 469 states have call predecessors, (473), 473 states have call successors, (473) [2025-03-17 04:55:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 8247 transitions. [2025-03-17 04:55:06,775 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 8247 transitions. Word has length 456 [2025-03-17 04:55:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:06,776 INFO L471 AbstractCegarLoop]: Abstraction has 5208 states and 8247 transitions. [2025-03-17 04:55:06,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 8247 transitions. [2025-03-17 04:55:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 04:55:06,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:06,780 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:55:06,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:06,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -404086661, now seen corresponding path program 1 times [2025-03-17 04:55:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771641165] [2025-03-17 04:55:06,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:06,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 04:55:07,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 04:55:07,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:07,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:55:10,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:10,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771641165] [2025-03-17 04:55:10,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771641165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:55:10,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:55:10,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:55:10,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128079300] [2025-03-17 04:55:10,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:55:10,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:55:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:10,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:55:10,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:55:10,684 INFO L87 Difference]: Start difference. First operand 5208 states and 8247 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:12,241 INFO L93 Difference]: Finished difference Result 13510 states and 21306 transitions. [2025-03-17 04:55:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:55:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-17 04:55:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:12,277 INFO L225 Difference]: With dead ends: 13510 [2025-03-17 04:55:12,278 INFO L226 Difference]: Without dead ends: 8826 [2025-03-17 04:55:12,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:55:12,292 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1601 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:12,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 2394 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:55:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2025-03-17 04:55:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 7774. [2025-03-17 04:55:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7774 states, 7218 states have (on average 1.552091992241618) internal successors, (11203), 7230 states have internal predecessors, (11203), 537 states have call successors, (537), 18 states have call predecessors, (537), 18 states have return successors, (537), 525 states have call predecessors, (537), 537 states have call successors, (537) [2025-03-17 04:55:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12277 transitions. [2025-03-17 04:55:12,561 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12277 transitions. Word has length 456 [2025-03-17 04:55:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:12,562 INFO L471 AbstractCegarLoop]: Abstraction has 7774 states and 12277 transitions. [2025-03-17 04:55:12,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12277 transitions. [2025-03-17 04:55:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 04:55:12,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:12,575 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:12,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:55:12,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:12,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 565494362, now seen corresponding path program 1 times [2025-03-17 04:55:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044309364] [2025-03-17 04:55:12,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:12,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 04:55:13,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 04:55:13,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:13,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-17 04:55:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044309364] [2025-03-17 04:55:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044309364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:55:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:55:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:55:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304611351] [2025-03-17 04:55:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:55:15,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:55:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:15,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:55:15,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:55:15,221 INFO L87 Difference]: Start difference. First operand 7774 states and 12277 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:17,122 INFO L93 Difference]: Finished difference Result 15557 states and 24566 transitions. [2025-03-17 04:55:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 04:55:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-17 04:55:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:17,153 INFO L225 Difference]: With dead ends: 15557 [2025-03-17 04:55:17,153 INFO L226 Difference]: Without dead ends: 11381 [2025-03-17 04:55:17,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:55:17,161 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1603 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:17,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 3045 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 04:55:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2025-03-17 04:55:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 9176. [2025-03-17 04:55:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9176 states, 8619 states have (on average 1.5584174498201648) internal successors, (13432), 8631 states have internal predecessors, (13432), 537 states have call successors, (537), 19 states have call predecessors, (537), 19 states have return successors, (537), 525 states have call predecessors, (537), 537 states have call successors, (537) [2025-03-17 04:55:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 14506 transitions. [2025-03-17 04:55:17,534 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 14506 transitions. Word has length 456 [2025-03-17 04:55:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:17,534 INFO L471 AbstractCegarLoop]: Abstraction has 9176 states and 14506 transitions. [2025-03-17 04:55:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-17 04:55:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 14506 transitions. [2025-03-17 04:55:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 04:55:17,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:17,544 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:17,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:55:17,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:17,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash 54960185, now seen corresponding path program 1 times [2025-03-17 04:55:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380823802] [2025-03-17 04:55:17,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:17,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:17,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 04:55:21,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 04:55:21,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:21,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 18 proven. 174 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 04:55:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:22,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380823802] [2025-03-17 04:55:22,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380823802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:55:22,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714937988] [2025-03-17 04:55:22,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:55:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:55:22,680 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-17 04:55:22,682 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-17 04:55:22,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 04:55:22,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 04:55:22,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:22,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:22,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:55:22,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:55:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 2584 proven. 156 refuted. 0 times theorem prover too weak. 5580 trivial. 0 not checked. [2025-03-17 04:55:23,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:55:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 36 proven. 156 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 04:55:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714937988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:55:23,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:55:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-17 04:55:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334300466] [2025-03-17 04:55:23,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:55:23,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:55:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:23,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:55:23,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:55:23,680 INFO L87 Difference]: Start difference. First operand 9176 states and 14506 transitions. Second operand has 13 states, 13 states have (on average 24.153846153846153) internal successors, (314), 13 states have internal predecessors, (314), 5 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (183), 5 states have call predecessors, (183), 5 states have call successors, (183) [2025-03-17 04:55:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:25,378 INFO L93 Difference]: Finished difference Result 31281 states and 49649 transitions. [2025-03-17 04:55:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 04:55:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 24.153846153846153) internal successors, (314), 13 states have internal predecessors, (314), 5 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (183), 5 states have call predecessors, (183), 5 states have call successors, (183) Word has length 456 [2025-03-17 04:55:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:25,426 INFO L225 Difference]: With dead ends: 31281 [2025-03-17 04:55:25,427 INFO L226 Difference]: Without dead ends: 22331 [2025-03-17 04:55:25,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 909 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2025-03-17 04:55:25,446 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1761 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:25,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 3023 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:55:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22331 states. [2025-03-17 04:55:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22331 to 14246. [2025-03-17 04:55:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14246 states, 13167 states have (on average 1.5380876433508013) internal successors, (20252), 13191 states have internal predecessors, (20252), 1009 states have call successors, (1009), 69 states have call predecessors, (1009), 69 states have return successors, (1009), 985 states have call predecessors, (1009), 1009 states have call successors, (1009) [2025-03-17 04:55:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14246 states to 14246 states and 22270 transitions. [2025-03-17 04:55:26,054 INFO L78 Accepts]: Start accepts. Automaton has 14246 states and 22270 transitions. Word has length 456 [2025-03-17 04:55:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:26,055 INFO L471 AbstractCegarLoop]: Abstraction has 14246 states and 22270 transitions. [2025-03-17 04:55:26,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.153846153846153) internal successors, (314), 13 states have internal predecessors, (314), 5 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (183), 5 states have call predecessors, (183), 5 states have call successors, (183) [2025-03-17 04:55:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 14246 states and 22270 transitions. [2025-03-17 04:55:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-17 04:55:26,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:26,068 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:26,077 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-17 04:55:26,268 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,SelfDestructingSolverStorable14 [2025-03-17 04:55:26,269 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:26,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2079257245, now seen corresponding path program 1 times [2025-03-17 04:55:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:26,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674818779] [2025-03-17 04:55:26,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:26,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-17 04:55:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-17 04:55:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 99 proven. 93 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 04:55:30,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674818779] [2025-03-17 04:55:30,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674818779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:55:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224288683] [2025-03-17 04:55:30,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:30,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:55:30,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:55:30,014 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-17 04:55:30,016 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-17 04:55:30,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-17 04:55:30,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-17 04:55:30,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:30,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:30,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:55:30,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:55:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 4222 proven. 93 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2025-03-17 04:55:31,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:55:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 99 proven. 93 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 04:55:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224288683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:55:31,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:55:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2025-03-17 04:55:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388184451] [2025-03-17 04:55:31,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:55:31,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 04:55:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:31,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 04:55:31,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:55:31,739 INFO L87 Difference]: Start difference. First operand 14246 states and 22270 transitions. Second operand has 12 states, 12 states have (on average 21.5) internal successors, (258), 12 states have internal predecessors, (258), 4 states have call successors, (195), 3 states have call predecessors, (195), 6 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) [2025-03-17 04:55:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:33,600 INFO L93 Difference]: Finished difference Result 47030 states and 73473 transitions. [2025-03-17 04:55:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 04:55:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 21.5) internal successors, (258), 12 states have internal predecessors, (258), 4 states have call successors, (195), 3 states have call predecessors, (195), 6 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) Word has length 457 [2025-03-17 04:55:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:33,691 INFO L225 Difference]: With dead ends: 47030 [2025-03-17 04:55:33,692 INFO L226 Difference]: Without dead ends: 37260 [2025-03-17 04:55:33,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2025-03-17 04:55:33,716 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1457 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:33,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 2569 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:55:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37260 states. [2025-03-17 04:55:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37260 to 24474. [2025-03-17 04:55:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24474 states, 22370 states have (on average 1.5302190433616452) internal successors, (34231), 22418 states have internal predecessors, (34231), 1953 states have call successors, (1953), 150 states have call predecessors, (1953), 150 states have return successors, (1953), 1905 states have call predecessors, (1953), 1953 states have call successors, (1953) [2025-03-17 04:55:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24474 states to 24474 states and 38137 transitions. [2025-03-17 04:55:34,822 INFO L78 Accepts]: Start accepts. Automaton has 24474 states and 38137 transitions. Word has length 457 [2025-03-17 04:55:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:34,823 INFO L471 AbstractCegarLoop]: Abstraction has 24474 states and 38137 transitions. [2025-03-17 04:55:34,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.5) internal successors, (258), 12 states have internal predecessors, (258), 4 states have call successors, (195), 3 states have call predecessors, (195), 6 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) [2025-03-17 04:55:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 24474 states and 38137 transitions. [2025-03-17 04:55:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-17 04:55:34,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:34,839 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:34,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 04:55:35,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:55:35,040 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:35,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1983650186, now seen corresponding path program 1 times [2025-03-17 04:55:35,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:35,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661310679] [2025-03-17 04:55:35,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:35,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-17 04:55:37,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-17 04:55:37,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:37,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 27 proven. 165 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 04:55:37,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:55:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661310679] [2025-03-17 04:55:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661310679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:55:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572610048] [2025-03-17 04:55:37,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:37,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:55:37,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:55:37,637 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-17 04:55:37,638 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-17 04:55:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-17 04:55:37,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-17 04:55:37,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:55:37,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:55:37,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:55:37,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:55:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 918 proven. 9 refuted. 0 times theorem prover too weak. 7393 trivial. 0 not checked. [2025-03-17 04:55:38,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:55:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 04:55:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572610048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:55:38,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:55:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2025-03-17 04:55:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987539782] [2025-03-17 04:55:38,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:55:38,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 04:55:38,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:55:38,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 04:55:38,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:55:38,257 INFO L87 Difference]: Start difference. First operand 24474 states and 38137 transitions. Second operand has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 4 states have call predecessors, (134), 4 states have call successors, (134) [2025-03-17 04:55:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:55:40,319 INFO L93 Difference]: Finished difference Result 35262 states and 54821 transitions. [2025-03-17 04:55:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 04:55:40,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 4 states have call predecessors, (134), 4 states have call successors, (134) Word has length 458 [2025-03-17 04:55:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:55:40,357 INFO L225 Difference]: With dead ends: 35262 [2025-03-17 04:55:40,357 INFO L226 Difference]: Without dead ends: 11074 [2025-03-17 04:55:40,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 913 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 04:55:40,385 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2049 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 951 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 951 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:55:40,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 2572 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [951 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 04:55:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2025-03-17 04:55:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10904. [2025-03-17 04:55:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10904 states, 9806 states have (on average 1.5008158270446665) internal successors, (14717), 9830 states have internal predecessors, (14717), 1009 states have call successors, (1009), 88 states have call predecessors, (1009), 88 states have return successors, (1009), 985 states have call predecessors, (1009), 1009 states have call successors, (1009) [2025-03-17 04:55:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10904 states to 10904 states and 16735 transitions. [2025-03-17 04:55:41,029 INFO L78 Accepts]: Start accepts. Automaton has 10904 states and 16735 transitions. Word has length 458 [2025-03-17 04:55:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:55:41,029 INFO L471 AbstractCegarLoop]: Abstraction has 10904 states and 16735 transitions. [2025-03-17 04:55:41,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 4 states have call predecessors, (134), 4 states have call successors, (134) [2025-03-17 04:55:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10904 states and 16735 transitions. [2025-03-17 04:55:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-17 04:55:41,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:55:41,037 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:55:41,046 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-17 04:55:41,241 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,SelfDestructingSolverStorable16 [2025-03-17 04:55:41,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:55:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:55:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 777318358, now seen corresponding path program 1 times [2025-03-17 04:55:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:55:41,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560177134] [2025-03-17 04:55:41,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:55:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:55:41,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.